Base | Representation |
---|---|
bin | 1010011110010100011100… |
… | …10000000010101010100001 |
3 | 10000112211121202122201221102 |
4 | 11033022032100002222201 |
5 | 11004324014302223131 |
6 | 120552431050404145 |
7 | 4565002314052244 |
oct | 517121620025241 |
9 | 100484552581842 |
10 | 23032001211041 |
11 | 737a8a9271269 |
12 | 26bb90a730655 |
13 | cb0ba6988374 |
14 | 598a7d29125b |
15 | 29e1adc551cb |
hex | 14f28e402aa1 |
23032001211041 has 2 divisors, whose sum is σ = 23032001211042. Its totient is φ = 23032001211040.
The previous prime is 23032001210993. The next prime is 23032001211061. The reversal of 23032001211041 is 14011210023032.
It is an a-pointer prime, because the next prime (23032001211061) can be obtained adding 23032001211041 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12563508606016 + 10468492605025 = 3544504^2 + 3235505^2 .
It is a cyclic number.
It is not a de Polignac number, because 23032001211041 - 230 = 23030927469217 is a prime.
It is not a weakly prime, because it can be changed into another prime (23032001211061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11516000605520 + 11516000605521.
It is an arithmetic number, because the mean of its divisors is an integer number (11516000605521).
Almost surely, 223032001211041 is an apocalyptic number.
It is an amenable number.
23032001211041 is a deficient number, since it is larger than the sum of its proper divisors (1).
23032001211041 is an equidigital number, since it uses as much as digits as its factorization.
23032001211041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 23032001211041 its reverse (14011210023032), we get a palindrome (37043211234073).
The spelling of 23032001211041 in words is "twenty-three trillion, thirty-two billion, one million, two hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •