Base | Representation |
---|---|
bin | 1010100011110101000100… |
… | …00111010010110011111111 |
3 | 10001012221021020020020010001 |
4 | 11101322202013102303333 |
5 | 11020424222113220411 |
6 | 121215420211455131 |
7 | 4614453532650661 |
oct | 521724207226377 |
9 | 101187236206101 |
10 | 23221313023231 |
11 | 74431159067a4 |
12 | 27305428b74a7 |
13 | cc59b685534b |
14 | 5a3cbba6c531 |
15 | 2a408dbcddc1 |
hex | 151ea21d2cff |
23221313023231 has 2 divisors, whose sum is σ = 23221313023232. Its totient is φ = 23221313023230.
The previous prime is 23221313023199. The next prime is 23221313023241. The reversal of 23221313023231 is 13232031312232.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 23221313023231 - 25 = 23221313023199 is a prime.
It is a super-2 number, since 2×232213130232312 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23221313023231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23221313023241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11610656511615 + 11610656511616.
It is an arithmetic number, because the mean of its divisors is an integer number (11610656511616).
Almost surely, 223221313023231 is an apocalyptic number.
23221313023231 is a deficient number, since it is larger than the sum of its proper divisors (1).
23221313023231 is an equidigital number, since it uses as much as digits as its factorization.
23221313023231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 23221313023231 its reverse (13232031312232), we get a palindrome (36453344335463).
The spelling of 23221313023231 in words is "twenty-three trillion, two hundred twenty-one billion, three hundred thirteen million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •