Base | Representation |
---|---|
bin | 1010011101011011000101… |
… | …00010100111110101100001 |
3 | 10000102220010101121021022012 |
4 | 11032231202202213311201 |
5 | 11003322430444111223 |
6 | 120530335024322305 |
7 | 4562532153411665 |
oct | 516554242476541 |
9 | 100386111537265 |
10 | 23001203113313 |
11 | 7368834576637 |
12 | 26b5954473395 |
13 | cab0091581b9 |
14 | 59739ac548a5 |
15 | 29d4aa02cc78 |
hex | 14eb628a7d61 |
23001203113313 has 2 divisors, whose sum is σ = 23001203113314. Its totient is φ = 23001203113312.
The previous prime is 23001203113193. The next prime is 23001203113327. The reversal of 23001203113313 is 31331130210032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18047271211264 + 4953931902049 = 4248208^2 + 2225743^2 .
It is a cyclic number.
It is not a de Polignac number, because 23001203113313 - 224 = 23001186336097 is a prime.
It is not a weakly prime, because it can be changed into another prime (23001203113813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11500601556656 + 11500601556657.
It is an arithmetic number, because the mean of its divisors is an integer number (11500601556657).
Almost surely, 223001203113313 is an apocalyptic number.
It is an amenable number.
23001203113313 is a deficient number, since it is larger than the sum of its proper divisors (1).
23001203113313 is an equidigital number, since it uses as much as digits as its factorization.
23001203113313 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 23.
Adding to 23001203113313 its reverse (31331130210032), we get a palindrome (54332333323345).
The spelling of 23001203113313 in words is "twenty-three trillion, one billion, two hundred three million, one hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •