Base | Representation |
---|---|
bin | 1001001001010010001101… |
… | …10000100000010110010011 |
3 | 2122012112000002100212211001 |
4 | 10210221012300200112103 |
5 | 10113441214321003103 |
6 | 110434302005002431 |
7 | 4143626045406505 |
oct | 444510660402623 |
9 | 78175002325731 |
10 | 20110224000403 |
11 | 64537751a2a49 |
12 | 23095b53b3417 |
13 | b2b50301c154 |
14 | 4d74a90add75 |
15 | 24d1a697901d |
hex | 124a46c20593 |
20110224000403 has 2 divisors, whose sum is σ = 20110224000404. Its totient is φ = 20110224000402.
The previous prime is 20110224000401. The next prime is 20110224000421. The reversal of 20110224000403 is 30400042201102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20110224000403 - 21 = 20110224000401 is a prime.
It is a super-2 number, since 2×201102240004032 (a number of 27 digits) contains 22 as substring.
Together with 20110224000401, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (20110224000401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055112000201 + 10055112000202.
It is an arithmetic number, because the mean of its divisors is an integer number (10055112000202).
Almost surely, 220110224000403 is an apocalyptic number.
20110224000403 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110224000403 is an equidigital number, since it uses as much as digits as its factorization.
20110224000403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 20110224000403 its reverse (30400042201102), we get a palindrome (50510266201505).
The spelling of 20110224000403 in words is "twenty trillion, one hundred ten billion, two hundred twenty-four million, four hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •