Base | Representation |
---|---|
bin | 10111001100011101010000… |
… | …100100111100101011011110 |
3 | 111101012011112100121111211220 |
4 | 113030131100210330223132 |
5 | 101332322233222012202 |
6 | 1000543132302154210 |
7 | 30326026440054054 |
oct | 2714352044745336 |
9 | 441164470544756 |
10 | 102011120110302 |
11 | 2a55a744972467 |
12 | b536531882966 |
13 | 44bc7b8469b30 |
14 | 1b295164ba1d4 |
15 | bbd823b64abc |
hex | 5cc75093cade |
102011120110302 has 32 divisors (see below), whose sum is σ = 219753518679072. Its totient is φ = 31382714102784.
The previous prime is 102011120110217. The next prime is 102011120110331. The reversal of 102011120110302 is 203011021110201.
It is a super-2 number, since 2×1020111201103022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 110429883 + ... + 111349814.
It is an arithmetic number, because the mean of its divisors is an integer number (6867297458721).
Almost surely, 2102011120110302 is an apocalyptic number.
102011120110302 is an abundant number, since it is smaller than the sum of its proper divisors (117742398568770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011120110302 is a wasteful number, since it uses less digits than its factorization.
102011120110302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221785612.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 102011120110302 its reverse (203011021110201), we get a palindrome (305022141220503).
The spelling of 102011120110302 in words is "one hundred two trillion, eleven billion, one hundred twenty million, one hundred ten thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •