Base | Representation |
---|---|
bin | 1001001101110000101101… |
… | …1110010000101001010001 |
3 | 1022212121111220210001111102 |
4 | 2103130023132100221101 |
5 | 2312000334201130022 |
6 | 33314330314554145 |
7 | 2064004623560603 |
oct | 223341336205121 |
9 | 38777456701442 |
10 | 10132020333137 |
11 | 3256a6937835a |
12 | 11777a1138955 |
13 | 5865a3776341 |
14 | 27056ca67173 |
15 | 128855333a92 |
hex | 9370b790a51 |
10132020333137 has 2 divisors, whose sum is σ = 10132020333138. Its totient is φ = 10132020333136.
The previous prime is 10132020333091. The next prime is 10132020333221. The reversal of 10132020333137 is 73133302023101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7687538114881 + 2444482218256 = 2772641^2 + 1563484^2 .
It is a cyclic number.
It is not a de Polignac number, because 10132020333137 - 220 = 10132019284561 is a prime.
It is a super-2 number, since 2×101320203331372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10132020323137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066010166568 + 5066010166569.
It is an arithmetic number, because the mean of its divisors is an integer number (5066010166569).
Almost surely, 210132020333137 is an apocalyptic number.
It is an amenable number.
10132020333137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10132020333137 is an equidigital number, since it uses as much as digits as its factorization.
10132020333137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6804, while the sum is 29.
Adding to 10132020333137 its reverse (73133302023101), we get a palindrome (83265322356238).
The spelling of 10132020333137 in words is "ten trillion, one hundred thirty-two billion, twenty million, three hundred thirty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •