Base | Representation |
---|---|
bin | 1001001101110000101110… |
… | …0000101010010110110001 |
3 | 1022212121111221222001010221 |
4 | 2103130023200222112301 |
5 | 2312000334331301422 |
6 | 33314330340253041 |
7 | 2064004632122302 |
oct | 223341340522661 |
9 | 38777457861127 |
10 | 10132020962737 |
11 | 3256a69768393 |
12 | 11777a13a1181 |
13 | 5865a3936a9b |
14 | 27056cb8c7a9 |
15 | 12885540a3c7 |
hex | 9370b82a5b1 |
10132020962737 has 2 divisors, whose sum is σ = 10132020962738. Its totient is φ = 10132020962736.
The previous prime is 10132020962663. The next prime is 10132020962797. The reversal of 10132020962737 is 73726902023101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9672044020081 + 459976942656 = 3109991^2 + 678216^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10132020962737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10132020962693 and 10132020962702.
It is not a weakly prime, because it can be changed into another prime (10132020962797) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066010481368 + 5066010481369.
It is an arithmetic number, because the mean of its divisors is an integer number (5066010481369).
Almost surely, 210132020962737 is an apocalyptic number.
It is an amenable number.
10132020962737 is a deficient number, since it is larger than the sum of its proper divisors (1).
10132020962737 is an equidigital number, since it uses as much as digits as its factorization.
10132020962737 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 190512, while the sum is 43.
Adding to 10132020962737 its reverse (73726902023101), we get a palindrome (83858922985838).
The spelling of 10132020962737 in words is "ten trillion, one hundred thirty-two billion, twenty million, nine hundred sixty-two thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •