Base | Representation |
---|---|
bin | 1010100110011100101011… |
… | …10001001001001000000101 |
3 | 10001112112112120222121012111 |
4 | 11103032111301021020011 |
5 | 11023413020322444023 |
6 | 121325021413221021 |
7 | 4624120515240544 |
oct | 523162561111005 |
9 | 101475476877174 |
10 | 23311300203013 |
11 | 74782a3270869 |
12 | 2745a77331771 |
13 | 1001327b091a4 |
14 | 5a83b6d9015b |
15 | 2a65a8d7700d |
hex | 153395c49205 |
23311300203013 has 2 divisors, whose sum is σ = 23311300203014. Its totient is φ = 23311300203012.
The previous prime is 23311300202999. The next prime is 23311300203017. The reversal of 23311300203013 is 31030200311332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14908734159489 + 8402566043524 = 3861183^2 + 2898718^2 .
It is a cyclic number.
It is not a de Polignac number, because 23311300203013 - 237 = 23173861249541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23311300203017) 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 as a sum of consecutive naturals, namely, 11655650101506 + 11655650101507.
It is an arithmetic number, because the mean of its divisors is an integer number (11655650101507).
Almost surely, 223311300203013 is an apocalyptic number.
It is an amenable number.
23311300203013 is a deficient number, since it is larger than the sum of its proper divisors (1).
23311300203013 is an equidigital number, since it uses as much as digits as its factorization.
23311300203013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 23311300203013 its reverse (31030200311332), we get a palindrome (54341500514345).
The spelling of 23311300203013 in words is "twenty-three trillion, three hundred eleven billion, three hundred million, two hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •