Base | Representation |
---|---|
bin | 1001010011100101001011… |
… | …0011001001111110110101 |
3 | 1100020011120202111102021102 |
4 | 2110321102303021332311 |
5 | 2320120114304203023 |
6 | 33432303320455445 |
7 | 2104144346351126 |
oct | 224712263117665 |
9 | 40204522442242 |
10 | 10232001241013 |
11 | 3295404a53242 |
12 | 119304461a585 |
13 | 592b4832c966 |
14 | 27533535804d |
15 | 12b257a4b628 |
hex | 94e52cc9fb5 |
10232001241013 has 2 divisors, whose sum is σ = 10232001241014. Its totient is φ = 10232001241012.
The previous prime is 10232001240977. The next prime is 10232001241139. The reversal of 10232001241013 is 31014210023201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6274058107249 + 3957943133764 = 2504807^2 + 1989458^2 .
It is a cyclic number.
It is not a de Polignac number, because 10232001241013 - 26 = 10232001240949 is a prime.
It is a super-2 number, since 2×102320012410132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10232001241313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5116000620506 + 5116000620507.
It is an arithmetic number, because the mean of its divisors is an integer number (5116000620507).
Almost surely, 210232001241013 is an apocalyptic number.
It is an amenable number.
10232001241013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10232001241013 is an equidigital number, since it uses as much as digits as its factorization.
10232001241013 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 10232001241013 its reverse (31014210023201), we get a palindrome (41246211264214).
The spelling of 10232001241013 in words is "ten trillion, two hundred thirty-two billion, one million, two hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •