Base | Representation |
---|---|
bin | 1010100000100111101000… |
… | …01101011101000010100001 |
3 | 10000211101120210202002221221 |
4 | 11100103310031131002201 |
5 | 11012122332413020001 |
6 | 121053020115415041 |
7 | 4603500436050151 |
oct | 520236415350241 |
9 | 100741523662857 |
10 | 23111021220001 |
11 | 7400368a805a0 |
12 | 27130a22b4481 |
13 | cb848aa6a510 |
14 | 59c817c0a761 |
15 | 2a12861961a1 |
hex | 1504f435d0a1 |
23111021220001 has 8 divisors (see below), whose sum is σ = 27151409545344. Its totient is φ = 19393863960720.
The previous prime is 23111021219987. The next prime is 23111021220073. The reversal of 23111021220001 is 10002212011132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23111021220001 - 223 = 23111012831393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23111001220001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80807766361 + ... + 80807766646.
It is an arithmetic number, because the mean of its divisors is an integer number (3393926193168).
Almost surely, 223111021220001 is an apocalyptic number.
It is an amenable number.
23111021220001 is a deficient number, since it is larger than the sum of its proper divisors (4040388325343).
23111021220001 is a wasteful number, since it uses less digits than its factorization.
23111021220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161615533031.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 23111021220001 its reverse (10002212011132), we get a palindrome (33113233231133).
The spelling of 23111021220001 in words is "twenty-three trillion, one hundred eleven billion, twenty-one million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •