Base | Representation |
---|---|
bin | 1010100000111000100011… |
… | …11101100111111000111101 |
3 | 10000212021001020111021212011 |
4 | 11100130101331213320331 |
5 | 11012244441220234323 |
6 | 121101122042411221 |
7 | 4604241613121413 |
oct | 520342175477075 |
9 | 100767036437764 |
10 | 23120110321213 |
11 | 7404202599894 |
12 | 27149ba200b11 |
13 | cb92a8b16609 |
14 | 59d03adb72b3 |
15 | 2a16190c320d |
hex | 150711f67e3d |
23120110321213 has 2 divisors, whose sum is σ = 23120110321214. Its totient is φ = 23120110321212.
The previous prime is 23120110321193. The next prime is 23120110321223. The reversal of 23120110321213 is 31212301102132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20430598880484 + 2689511440729 = 4520022^2 + 1639973^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23120110321213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23120110321223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11560055160606 + 11560055160607.
It is an arithmetic number, because the mean of its divisors is an integer number (11560055160607).
Almost surely, 223120110321213 is an apocalyptic number.
It is an amenable number.
23120110321213 is a deficient number, since it is larger than the sum of its proper divisors (1).
23120110321213 is an equidigital number, since it uses as much as digits as its factorization.
23120110321213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 23120110321213 its reverse (31212301102132), we get a palindrome (54332411423345).
The spelling of 23120110321213 in words is "twenty-three trillion, one hundred twenty billion, one hundred ten million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •