Base | Representation |
---|---|
bin | 1010011110101001100000… |
… | …11000001110110001100101 |
3 | 10000120220210222101202222112 |
4 | 11033110300120032301211 |
5 | 11010020200131421011 |
6 | 121001541231010405 |
7 | 4565552506304102 |
oct | 517246030166145 |
9 | 100526728352875 |
10 | 23043311201381 |
11 | 7384682487419 |
12 | 2701b46369a05 |
13 | cb1c89b9ab43 |
14 | 5994333b5aa9 |
15 | 29e621b2858b |
hex | 14f53060ec65 |
23043311201381 has 2 divisors, whose sum is σ = 23043311201382. Its totient is φ = 23043311201380.
The previous prime is 23043311201341. The next prime is 23043311201419. The reversal of 23043311201381 is 18310211334032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15267071436100 + 7776239765281 = 3907310^2 + 2788591^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23043311201381 is a prime.
It is a super-2 number, since 2×230433112013812 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23043311201311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11521655600690 + 11521655600691.
It is an arithmetic number, because the mean of its divisors is an integer number (11521655600691).
Almost surely, 223043311201381 is an apocalyptic number.
It is an amenable number.
23043311201381 is a deficient number, since it is larger than the sum of its proper divisors (1).
23043311201381 is an equidigital number, since it uses as much as digits as its factorization.
23043311201381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 23043311201381 in words is "twenty-three trillion, forty-three billion, three hundred eleven million, two hundred one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •