Base | Representation |
---|---|
bin | 10111001100101000100001… |
… | …110010110000001101111011 |
3 | 111101020022202121212210000222 |
4 | 113030220201302300031323 |
5 | 101333022023321231021 |
6 | 1000552453103050255 |
7 | 30326635334226605 |
oct | 2714504162601573 |
9 | 441208677783028 |
10 | 102023220102011 |
11 | 2a56489400a30a |
12 | b538949ba098b |
13 | 44c0996241440 |
14 | 1b29d434c6175 |
15 | bbdcd10876ab |
hex | 5cca21cb037b |
102023220102011 has 64 divisors (see below), whose sum is σ = 112642843063296. Its totient is φ = 91830765312000.
The previous prime is 102023220101993. The next prime is 102023220102029. The reversal of 102023220102011 is 110201022320201.
It is an interprime number because it is at equal distance from previous prime (102023220101993) and next prime (102023220102029).
It is not a de Polignac number, because 102023220102011 - 26 = 102023220101947 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102023220102311) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 78419077061 + ... + 78419078361.
It is an arithmetic number, because the mean of its divisors is an integer number (1760044422864).
Almost surely, 2102023220102011 is an apocalyptic number.
102023220102011 is a deficient number, since it is larger than the sum of its proper divisors (10619622961285).
102023220102011 is a wasteful number, since it uses less digits than its factorization.
102023220102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3112.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 102023220102011 its reverse (110201022320201), we get a palindrome (212224242422212).
The spelling of 102023220102011 in words is "one hundred two trillion, twenty-three billion, two hundred twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •