Base | Representation |
---|---|
bin | 10111001100011101001111… |
… | …011111111100101000111001 |
3 | 111101012011111002120112122020 |
4 | 113030131033133330220321 |
5 | 101332322214104202301 |
6 | 1000543130414345053 |
7 | 30326026130240061 |
oct | 2714351737745071 |
9 | 441164432515566 |
10 | 102011102022201 |
11 | 2a55a735738619 |
12 | b5365277bb189 |
13 | 44bc7b47a5a08 |
14 | 1b29513d2c3a1 |
15 | bbd822290436 |
hex | 5cc74f7fca39 |
102011102022201 has 8 divisors (see below), whose sum is σ = 136070523641184. Its totient is φ = 67979540875680.
The previous prime is 102011102022187. The next prime is 102011102022209. The reversal of 102011102022201 is 102220201110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-102011102022201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102011102022209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6965109571 + ... + 6965124216.
It is an arithmetic number, because the mean of its divisors is an integer number (17008815455148).
Almost surely, 2102011102022201 is an apocalyptic number.
It is an amenable number.
102011102022201 is a deficient number, since it is larger than the sum of its proper divisors (34059421618983).
102011102022201 is a wasteful number, since it uses less digits than its factorization.
102011102022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13930236231.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102011102022201 its reverse (102220201110201), we get a palindrome (204231303132402).
The spelling of 102011102022201 in words is "one hundred two trillion, eleven billion, one hundred two million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •