Base | Representation |
---|---|
bin | 10101100010110010… |
… | …011010111110000001 |
3 | 2012201010100121010112 |
4 | 111202302122332001 |
5 | 334333322040223 |
6 | 14343215441105 |
7 | 1446144431315 |
oct | 254262327601 |
9 | 65633317115 |
10 | 23132221313 |
11 | 98a0599283 |
12 | 4596b26195 |
13 | 22485a4a26 |
14 | 11962a9b45 |
15 | 905c2b778 |
hex | 562c9af81 |
23132221313 has 2 divisors, whose sum is σ = 23132221314. Its totient is φ = 23132221312.
The previous prime is 23132221309. The next prime is 23132221337. The reversal of 23132221313 is 31312223132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22226933569 + 905287744 = 149087^2 + 30088^2 .
It is a cyclic number.
It is not a de Polignac number, because 23132221313 - 22 = 23132221309 is a prime.
It is a super-3 number, since 3×231322213133 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (23132221303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11566110656 + 11566110657.
It is an arithmetic number, because the mean of its divisors is an integer number (11566110657).
Almost surely, 223132221313 is an apocalyptic number.
It is an amenable number.
23132221313 is a deficient number, since it is larger than the sum of its proper divisors (1).
23132221313 is an equidigital number, since it uses as much as digits as its factorization.
23132221313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296, while the sum is 23.
Adding to 23132221313 its reverse (31312223132), we get a palindrome (54444444445).
The spelling of 23132221313 in words is "twenty-three billion, one hundred thirty-two million, two hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •