Base | Representation |
---|---|
bin | 10110111101110001101000… |
… | …111011000000111000101000 |
3 | 111020121201100202120020122010 |
4 | 112331301220323000320220 |
5 | 101214310012033431240 |
6 | 554451435243355520 |
7 | 30163111644104535 |
oct | 2675615073007050 |
9 | 436551322506563 |
10 | 101002211233320 |
11 | 2a200885134421 |
12 | b3b2aa4222ba0 |
13 | 4448610577167 |
14 | 1ad2766bbbd8c |
15 | ba2475221280 |
hex | 5bdc68ec0e28 |
101002211233320 has 32 divisors (see below), whose sum is σ = 303006633700320. Its totient is φ = 26933922995520.
The previous prime is 101002211233309. The next prime is 101002211233387. The reversal of 101002211233320 is 23332112200101.
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 7 ways as a sum of consecutive naturals, for example, 420842546686 + ... + 420842546925.
It is an arithmetic number, because the mean of its divisors is an integer number (9468957303135).
Almost surely, 2101002211233320 is an apocalyptic number.
101002211233320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101002211233320 is an abundant number, since it is smaller than the sum of its proper divisors (202004422467000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002211233320 is a wasteful number, since it uses less digits than its factorization.
101002211233320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841685093625 (or 841685093621 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101002211233320 its reverse (23332112200101), we get a palindrome (124334323433421).
The spelling of 101002211233320 in words is "one hundred one trillion, two billion, two hundred eleven million, two hundred thirty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •