Base | Representation |
---|---|
bin | 1010100000100111100111… |
… | …00111001111000001001111 |
3 | 10000211101120002220002121122 |
4 | 11100103303213033001033 |
5 | 11012122322331413403 |
6 | 121053015120551155 |
7 | 4603500254641430 |
oct | 520236347170117 |
9 | 100741502802548 |
10 | 23111011201103 |
11 | 7400363358211 |
12 | 271309aa824bb |
13 | cb8488970187 |
14 | 59c81675d487 |
15 | 2a1285367838 |
hex | 1504f39cf04f |
23111011201103 has 32 divisors (see below), whose sum is σ = 27790136128512. Its totient is φ = 18791237203200.
The previous prime is 23111011201099. The next prime is 23111011201139. The reversal of 23111011201103 is 30110211011132.
It is not a de Polignac number, because 23111011201103 - 22 = 23111011201099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23111011201903) 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 31 ways as a sum of consecutive naturals, for example, 8335325 + ... + 10756377.
It is an arithmetic number, because the mean of its divisors is an integer number (868441754016).
Almost surely, 223111011201103 is an apocalyptic number.
23111011201103 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
23111011201103 is a deficient number, since it is larger than the sum of its proper divisors (4679124927409).
23111011201103 is a wasteful number, since it uses less digits than its factorization.
23111011201103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2421575.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 23111011201103 its reverse (30110211011132), we get a palindrome (53221222212235).
The spelling of 23111011201103 in words is "twenty-three trillion, one hundred eleven billion, eleven million, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •