Base | Representation |
---|---|
bin | 110001000000110101… |
… | …0101000100100101000 |
3 | 101001200101012022221212 |
4 | 1202001222220210220 |
5 | 3211030142332300 |
6 | 120204152252252 |
7 | 10414210532135 |
oct | 1420152504450 |
9 | 331611168855 |
10 | 105254652200 |
11 | 40702564075 |
12 | 184956a1088 |
13 | 9c0534c3b9 |
14 | 5146c8d58c |
15 | 2b106e3935 |
hex | 1881aa8928 |
105254652200 has 48 divisors (see below), whose sum is σ = 244969544160. Its totient is φ = 42058424000.
The previous prime is 105254652197. The next prime is 105254652229. The reversal of 105254652200 is 2256452501.
105254652200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1052546522002 (a number of 23 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 76796 + ... + 465195.
It is an arithmetic number, because the mean of its divisors is an integer number (5103532170).
Almost surely, 2105254652200 is an apocalyptic number.
105254652200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105254652200 is an abundant number, since it is smaller than the sum of its proper divisors (139714891960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105254652200 is a wasteful number, since it uses less digits than its factorization.
105254652200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542978 (or 542969 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 32.
The spelling of 105254652200 in words is "one hundred five billion, two hundred fifty-four million, six hundred fifty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •