Base | Representation |
---|---|
bin | 1010100110001011010111… |
… | …00000010011001101100011 |
3 | 10001111122112112021211011200 |
4 | 11103011223200103031203 |
5 | 11023234444302211321 |
6 | 121320442551412243 |
7 | 4623341212143423 |
oct | 523055340231543 |
9 | 101448475254150 |
10 | 23302001210211 |
11 | 7474361223949 |
12 | 2744101084083 |
13 | 10004a5421699 |
14 | 5a7b73d88483 |
15 | 2a62127d9d26 |
hex | 15316b813363 |
23302001210211 has 6 divisors (see below), whose sum is σ = 33658446192540. Its totient is φ = 15534667473468.
The previous prime is 23302001210203. The next prime is 23302001210233. The reversal of 23302001210211 is 11201210020332.
23302001210211 is a `hidden beast` number, since 2 + 330 + 2 + 0 + 0 + 121 + 0 + 211 = 666.
It is not a de Polignac number, because 23302001210211 - 23 = 23302001210203 is a prime.
It is a super-2 number, since 2×233020012102112 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23302001210261) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1294555622781 + ... + 1294555622798.
It is an arithmetic number, because the mean of its divisors is an integer number (5609741032090).
Almost surely, 223302001210211 is an apocalyptic number.
23302001210211 is a deficient number, since it is larger than the sum of its proper divisors (10356444982329).
23302001210211 is a wasteful number, since it uses less digits than its factorization.
23302001210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2589111245585 (or 2589111245582 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 23302001210211 its reverse (11201210020332), we get a palindrome (34503211230543).
The spelling of 23302001210211 in words is "twenty-three trillion, three hundred two billion, one million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •