Base | Representation |
---|---|
bin | 10111001100011101010000… |
… | …101100001100101110001110 |
3 | 111101012011112111012002010221 |
4 | 113030131100230030232032 |
5 | 101332322234213323042 |
6 | 1000543132411021554 |
7 | 30326026462161400 |
oct | 2714352054145616 |
9 | 441164474162127 |
10 | 102011122011022 |
11 | 2a55a745a50504 |
12 | b53653243a8ba |
13 | 44bc7b8984013 |
14 | 1b29516852b70 |
15 | bbd823ddcd67 |
hex | 5cc750b0cb8e |
102011122011022 has 24 divisors (see below), whose sum is σ = 180655700094504. Its totient is φ = 43066529119152.
The previous prime is 102011122011011. The next prime is 102011122011041. The reversal of 102011122011022 is 220110221110201.
It is a junction number, because it is equal to n+sod(n) for n = 102011122010987 and 102011122011005.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 7768126393 + ... + 7768139524.
It is an arithmetic number, because the mean of its divisors is an integer number (7527320837271).
Almost surely, 2102011122011022 is an apocalyptic number.
102011122011022 is a deficient number, since it is larger than the sum of its proper divisors (78644578083482).
102011122011022 is a wasteful number, since it uses less digits than its factorization.
102011122011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15536266000 (or 15536265993 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102011122011022 its reverse (220110221110201), we get a palindrome (322121343121223).
The spelling of 102011122011022 in words is "one hundred two trillion, eleven billion, one hundred twenty-two million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •