Base | Representation |
---|---|
bin | 1001000110011000010100… |
… | …01110001011101011000001 |
3 | 2121211222101212021202212011 |
4 | 10203030022032023223001 |
5 | 10110322322033401144 |
6 | 110320354551132521 |
7 | 4133463651423154 |
oct | 443141216135301 |
9 | 77758355252764 |
10 | 20010424122049 |
11 | 6415411823239 |
12 | 22b21a2674141 |
13 | b21c89b0a1aa |
14 | 4d271c863c9b |
15 | 24a7b50bea34 |
hex | 12330a38bac1 |
20010424122049 has 2 divisors, whose sum is σ = 20010424122050. Its totient is φ = 20010424122048.
The previous prime is 20010424122037. The next prime is 20010424122167. The reversal of 20010424122049 is 94022142401002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14919624683649 + 5090799438400 = 3862593^2 + 2256280^2 .
It is a cyclic number.
It is not a de Polignac number, because 20010424122049 - 233 = 20001834187457 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20010424122049.
It is not a weakly prime, because it can be changed into another prime (20010494122049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005212061024 + 10005212061025.
It is an arithmetic number, because the mean of its divisors is an integer number (10005212061025).
Almost surely, 220010424122049 is an apocalyptic number.
It is an amenable number.
20010424122049 is a deficient number, since it is larger than the sum of its proper divisors (1).
20010424122049 is an equidigital number, since it uses as much as digits as its factorization.
20010424122049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 31.
The spelling of 20010424122049 in words is "twenty trillion, ten billion, four hundred twenty-four million, one hundred twenty-two thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •