Base | Representation |
---|---|
bin | 1010100000101010000000… |
… | …11101010101000100110101 |
3 | 10000211111212221211201202112 |
4 | 11100111000131111010311 |
5 | 11012132442403400401 |
6 | 121053351054020405 |
7 | 4603544231244032 |
oct | 520250035250465 |
9 | 100744787751675 |
10 | 23112300450101 |
11 | 7400965082055 |
12 | 271339a7a7705 |
13 | cb8632ab27c5 |
14 | 59c8d9a82389 |
15 | 2a130d6323bb |
hex | 150540755135 |
23112300450101 has 4 divisors (see below), whose sum is σ = 23112504795072. Its totient is φ = 23112096105132.
The previous prime is 23112300450073. The next prime is 23112300450103. The reversal of 23112300450101 is 10105400321132.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23112300450101 - 218 = 23112300187957 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 (23112300450103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 102002735 + ... + 102229068.
It is an arithmetic number, because the mean of its divisors is an integer number (5778126198768).
Almost surely, 223112300450101 is an apocalyptic number.
It is an amenable number.
23112300450101 is a deficient number, since it is larger than the sum of its proper divisors (204344971).
23112300450101 is a wasteful number, since it uses less digits than its factorization.
23112300450101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204344970.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 23112300450101 its reverse (10105400321132), we get a palindrome (33217700771233).
The spelling of 23112300450101 in words is "twenty-three trillion, one hundred twelve billion, three hundred million, four hundred fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •