Base | Representation |
---|---|
bin | 1001010001110000000000… |
… | …11000010100100000000101 |
3 | 2200020022210210211001211101 |
4 | 10220320000120110200011 |
5 | 10133222423331001204 |
6 | 111220045245140101 |
7 | 4203634205363026 |
oct | 450700030244005 |
9 | 80208723731741 |
10 | 20401101031429 |
11 | 6556070749668 |
12 | 2355a5355a631 |
13 | b4ca7aa74361 |
14 | 5075c074ac4d |
15 | 255a2d26aea4 |
hex | 128e00614805 |
20401101031429 has 2 divisors, whose sum is σ = 20401101031430. Its totient is φ = 20401101031428.
The previous prime is 20401101031403. The next prime is 20401101031439. The reversal of 20401101031429 is 92413010110402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19624811400100 + 776289631329 = 4429990^2 + 881073^2 .
It is a cyclic number.
It is not a de Polignac number, because 20401101031429 - 27 = 20401101031301 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20401101031397 and 20401101031406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20401101031439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10200550515714 + 10200550515715.
It is an arithmetic number, because the mean of its divisors is an integer number (10200550515715).
Almost surely, 220401101031429 is an apocalyptic number.
It is an amenable number.
20401101031429 is a deficient number, since it is larger than the sum of its proper divisors (1).
20401101031429 is an equidigital number, since it uses as much as digits as its factorization.
20401101031429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 20401101031429 in words is "twenty trillion, four hundred one billion, one hundred one million, thirty-one thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •