Base | Representation |
---|---|
bin | 111000100010000101… |
… | …1101100111000111101 |
3 | 102121100210011112000101 |
4 | 1301010023230320331 |
5 | 3442113132034204 |
6 | 131434411401101 |
7 | 11525323331332 |
oct | 1610413547075 |
9 | 377323145011 |
10 | 121403002429 |
11 | 47539914665 |
12 | 1b641753191 |
13 | b5a9a77617 |
14 | 5c397da989 |
15 | 325823eea4 |
hex | 1c442ece3d |
121403002429 has 2 divisors, whose sum is σ = 121403002430. Its totient is φ = 121403002428.
The previous prime is 121403002421. The next prime is 121403002451. The reversal of 121403002429 is 924200304121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 62257735225 + 59145267204 = 249515^2 + 243198^2 .
It is an emirp because it is prime and its reverse (924200304121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121403002429 - 23 = 121403002421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121403002397 and 121403002406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121403002421) 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, 60701501214 + 60701501215.
It is an arithmetic number, because the mean of its divisors is an integer number (60701501215).
Almost surely, 2121403002429 is an apocalyptic number.
It is an amenable number.
121403002429 is a deficient number, since it is larger than the sum of its proper divisors (1).
121403002429 is an equidigital number, since it uses as much as digits as its factorization.
121403002429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
The spelling of 121403002429 in words is "one hundred twenty-one billion, four hundred three million, two thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •