Base | Representation |
---|---|
bin | 1010011110101001100000… |
… | …11011010100011100001101 |
3 | 10000120220211000220220121012 |
4 | 11033110300123110130031 |
5 | 11010020200333323041 |
6 | 121001541300215005 |
7 | 4565552516215421 |
oct | 517246033243415 |
9 | 100526730826535 |
10 | 23043312011021 |
11 | 738468298a745 |
12 | 2701b4669a465 |
13 | cb1c8a0c2513 |
14 | 599433546b81 |
15 | 29e621c383eb |
hex | 14f5306d470d |
23043312011021 has 2 divisors, whose sum is σ = 23043312011022. Its totient is φ = 23043312011020.
The previous prime is 23043312011009. The next prime is 23043312011033. The reversal of 23043312011021 is 12011021334032.
It is a balanced prime because it is at equal distance from previous prime (23043312011009) and next prime (23043312011033).
It can be written as a sum of positive squares in only one way, i.e., 16592677174921 + 6450634836100 = 4073411^2 + 2539810^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23043312011021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23043312011051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11521656005510 + 11521656005511.
It is an arithmetic number, because the mean of its divisors is an integer number (11521656005511).
Almost surely, 223043312011021 is an apocalyptic number.
It is an amenable number.
23043312011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
23043312011021 is an equidigital number, since it uses as much as digits as its factorization.
23043312011021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 23043312011021 its reverse (12011021334032), we get a palindrome (35054333345053).
The spelling of 23043312011021 in words is "twenty-three trillion, forty-three billion, three hundred twelve million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •