Base | Representation |
---|---|
bin | 1001001001000100000000… |
… | …00010101011101111110001 |
3 | 2122011210022102022020022022 |
4 | 10210202000002223233301 |
5 | 10113330103323214101 |
6 | 110431001003521225 |
7 | 4143236022166025 |
oct | 444420002535761 |
9 | 78153272266268 |
10 | 20102595132401 |
11 | 645050a973561 |
12 | 2308026529215 |
13 | b2a888650982 |
14 | 4d6d83c14385 |
15 | 24cdabd3da1b |
hex | 1248800abbf1 |
20102595132401 has 2 divisors, whose sum is σ = 20102595132402. Its totient is φ = 20102595132400.
The previous prime is 20102595132379. The next prime is 20102595132407. The reversal of 20102595132401 is 10423159520102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16490713887376 + 3611881245025 = 4060876^2 + 1900495^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102595132401 - 218 = 20102594870257 is a prime.
It is a super-3 number, since 3×201025951324013 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (20102595132407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051297566200 + 10051297566201.
It is an arithmetic number, because the mean of its divisors is an integer number (10051297566201).
Almost surely, 220102595132401 is an apocalyptic number.
It is an amenable number.
20102595132401 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102595132401 is an equidigital number, since it uses as much as digits as its factorization.
20102595132401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21600, while the sum is 35.
The spelling of 20102595132401 in words is "twenty trillion, one hundred two billion, five hundred ninety-five million, one hundred thirty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •