Base | Representation |
---|---|
bin | 101111010100000100… |
… | …0000010101101011110 |
3 | 100201021000121011001110 |
4 | 1132220020002231132 |
5 | 3131041330201400 |
6 | 114402054122450 |
7 | 10224602432622 |
oct | 1365010025536 |
9 | 321230534043 |
10 | 101604928350 |
11 | 3a0aa373572 |
12 | 17837350426 |
13 | 977317c7a3 |
14 | 4cbc279182 |
15 | 299a0ade50 |
hex | 17a8202b5e |
101604928350 has 48 divisors (see below), whose sum is σ = 252040462128. Its totient is φ = 27088170240.
The previous prime is 101604928319. The next prime is 101604928361. The reversal of 101604928350 is 53829406101.
It is a super-2 number, since 2×1016049283502 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101604928299 and 101604928308.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 565732 + ... + 723368.
It is an arithmetic number, because the mean of its divisors is an integer number (5250842961).
Almost surely, 2101604928350 is an apocalyptic number.
101604928350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101604928350 is an abundant number, since it is smaller than the sum of its proper divisors (150435533778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101604928350 is a wasteful number, since it uses less digits than its factorization.
101604928350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161949 (or 161944 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 39.
The spelling of 101604928350 in words is "one hundred one billion, six hundred four million, nine hundred twenty-eight thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •