Base | Representation |
---|---|
bin | 111000011101000111… |
… | …1000111011110111101 |
3 | 102120221011011022002011 |
4 | 1300322033013132331 |
5 | 3441242422010004 |
6 | 131410050531221 |
7 | 11521226031133 |
oct | 1607217073675 |
9 | 376834138064 |
10 | 121236125629 |
11 | 474636a5653 |
12 | 1b5b5896b11 |
13 | b581319a58 |
14 | 5c2159b753 |
15 | 324877a004 |
hex | 1c3a3c77bd |
121236125629 has 2 divisors, whose sum is σ = 121236125630. Its totient is φ = 121236125628.
The previous prime is 121236125627. The next prime is 121236125641. The reversal of 121236125629 is 926521632121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 118954630404 + 2281495225 = 344898^2 + 47765^2 .
It is a cyclic number.
It is not a de Polignac number, because 121236125629 - 21 = 121236125627 is a prime.
Together with 121236125627, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 121236125591 and 121236125600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121236125627) 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, 60618062814 + 60618062815.
It is an arithmetic number, because the mean of its divisors is an integer number (60618062815).
Almost surely, 2121236125629 is an apocalyptic number.
It is an amenable number.
121236125629 is a deficient number, since it is larger than the sum of its proper divisors (1).
121236125629 is an equidigital number, since it uses as much as digits as its factorization.
121236125629 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 77760, while the sum is 40.
The spelling of 121236125629 in words is "one hundred twenty-one billion, two hundred thirty-six million, one hundred twenty-five thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •