Base | Representation |
---|---|
bin | 11000000001100111101011… |
… | …111100110101100010101000 |
3 | 111212010102102010112022000220 |
4 | 120001213223330311202220 |
5 | 102322201242423330400 |
6 | 1012421324444130040 |
7 | 31154001356445000 |
oct | 3001475374654250 |
9 | 455112363468026 |
10 | 105664449042600 |
11 | 3073904a8aa8a8 |
12 | ba2658a236920 |
13 | 46c6165269276 |
14 | 1c14288135000 |
15 | c33894e867a0 |
hex | 6019ebf358a8 |
105664449042600 has 192 divisors, whose sum is σ = 381993927312000. Its totient is φ = 24151874019840.
The previous prime is 105664449042577. The next prime is 105664449042641. The reversal of 105664449042600 is 6240944466501.
It is a super-2 number, since 2×1056644490426002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 256510549 + ... + 256922148.
It is an arithmetic number, because the mean of its divisors is an integer number (1989551704750).
Almost surely, 2105664449042600 is an apocalyptic number.
105664449042600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105664449042600 is an abundant number, since it is smaller than the sum of its proper divisors (276329478269400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105664449042600 is a wasteful number, since it uses less digits than its factorization.
105664449042600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513432737 (or 513432714 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 51.
The spelling of 105664449042600 in words is "one hundred five trillion, six hundred sixty-four billion, four hundred forty-nine million, forty-two thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •