Base | Representation |
---|---|
bin | 1010011101101101101101… |
… | …00010000111111010111001 |
3 | 10000110211221020122200011011 |
4 | 11032312312202013322321 |
5 | 11004003420231001241 |
6 | 120535111135433521 |
7 | 4563335020313623 |
oct | 516666642077271 |
9 | 100424836580134 |
10 | 23011202203321 |
11 | 7371aa5819992 |
12 | 26b78850858a1 |
13 | cabc408b73c7 |
14 | 597a68c1bc13 |
15 | 29d892cab281 |
hex | 14edb6887eb9 |
23011202203321 has 8 divisors (see below), whose sum is σ = 23808749497920. Its totient is φ = 22213925413008.
The previous prime is 23011202203273. The next prime is 23011202203331. The reversal of 23011202203321 is 12330220211032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23011202203321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23011202203292 and 23011202203301.
It is not an unprimeable number, because it can be changed into a prime (23011202203331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67452981 + ... + 67793266.
It is an arithmetic number, because the mean of its divisors is an integer number (2976093687240).
Almost surely, 223011202203321 is an apocalyptic number.
It is an amenable number.
23011202203321 is a deficient number, since it is larger than the sum of its proper divisors (797547294599).
23011202203321 is a wasteful number, since it uses less digits than its factorization.
23011202203321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135252143.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 23011202203321 its reverse (12330220211032), we get a palindrome (35341422414353).
The spelling of 23011202203321 in words is "twenty-three trillion, eleven billion, two hundred two million, two hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •