Base | Representation |
---|---|
bin | 1001001001110111010001… |
… | …01001101110000110111001 |
3 | 2122021102100200012101020101 |
4 | 10210323220221232012321 |
5 | 10114302441204444204 |
6 | 110451352141155401 |
7 | 4145232065540152 |
oct | 444735051560671 |
9 | 78242320171211 |
10 | 20130119999929 |
11 | 6461154a48965 |
12 | 231142855bb61 |
13 | b30353cb2434 |
14 | 4d8435642929 |
15 | 24d96d4eeea4 |
hex | 124ee8a6e1b9 |
20130119999929 has 2 divisors, whose sum is σ = 20130119999930. Its totient is φ = 20130119999928.
The previous prime is 20130119999833. The next prime is 20130119999953. The reversal of 20130119999929 is 92999991103102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19044949858704 + 1085170141225 = 4364052^2 + 1041715^2 .
It is a cyclic number.
It is not a de Polignac number, because 20130119999929 - 29 = 20130119999417 is a prime.
It is not a weakly prime, because it can be changed into another prime (20130119999959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065059999964 + 10065059999965.
It is an arithmetic number, because the mean of its divisors is an integer number (10065059999965).
Almost surely, 220130119999929 is an apocalyptic number.
It is an amenable number.
20130119999929 is a deficient number, since it is larger than the sum of its proper divisors (1).
20130119999929 is an equidigital number, since it uses as much as digits as its factorization.
20130119999929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6377292, while the sum is 64.
The spelling of 20130119999929 in words is "twenty trillion, one hundred thirty billion, one hundred nineteen million, nine hundred ninety-nine thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.276 sec. • engine limits •