Base | Representation |
---|---|
bin | 10001011011011… |
… | …01010111000000 |
3 | 101012002201200211 |
4 | 20231231113000 |
5 | 244411400000 |
6 | 22301323504 |
7 | 3423452032 |
oct | 1055552700 |
9 | 335081624 |
10 | 146200000 |
11 | 75587251 |
12 | 40b66594 |
13 | 2439b39b |
14 | 155b9c52 |
15 | cc7d7ba |
hex | 8b6d5c0 |
146200000 has 168 divisors, whose sum is σ = 392881104. Its totient is φ = 53760000.
The previous prime is 146199997. The next prime is 146200027. The reversal of 146200000 is 2641.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3399979 + ... + 3400021.
It is an arithmetic number, because the mean of its divisors is an integer number (2338578).
Almost surely, 2146200000 is an apocalyptic number.
146200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196440552).
146200000 is an abundant number, since it is smaller than the sum of its proper divisors (246681104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146200000 is an frugal number, since it uses more digits than its factorization.
146200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97 (or 67 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 146200000 is about 12091.3192001535. The cubic root of 146200000 is about 526.8040731759.
Adding to 146200000 its reverse (2641), we get a palindrome (146202641).
The spelling of 146200000 in words is "one hundred forty-six million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •