Base | Representation |
---|---|
bin | 1001001001010010001010… |
… | …11001100010000110001101 |
3 | 2122012111221111110112222002 |
4 | 10210221011121202012031 |
5 | 10113441143001413122 |
6 | 110434255432202045 |
7 | 4143625350541163 |
oct | 444510531420615 |
9 | 78174844415862 |
10 | 20110201201037 |
11 | 64537633404a2 |
12 | 23095a9839325 |
13 | b2b4cb3987bc |
14 | 4d74a6057233 |
15 | 24d1a4973992 |
hex | 124a4566218d |
20110201201037 has 2 divisors, whose sum is σ = 20110201201038. Its totient is φ = 20110201201036.
The previous prime is 20110201200937. The next prime is 20110201201039. The reversal of 20110201201037 is 73010210201102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17307838152361 + 2802363048676 = 4160269^2 + 1674026^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110201201037 - 220 = 20110200152461 is a prime.
Together with 20110201201039, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110201201039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055100600518 + 10055100600519.
It is an arithmetic number, because the mean of its divisors is an integer number (10055100600519).
Almost surely, 220110201201037 is an apocalyptic number.
It is an amenable number.
20110201201037 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110201201037 is an equidigital number, since it uses as much as digits as its factorization.
20110201201037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 20110201201037 its reverse (73010210201102), we get a palindrome (93120411402139).
The spelling of 20110201201037 in words is "twenty trillion, one hundred ten billion, two hundred one million, two hundred one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •