Base | Representation |
---|---|
bin | 101101011001110101101… |
… | …101111011101010011101 |
3 | 102001021120121120010000201 |
4 | 231121311231323222131 |
5 | 402110002013411104 |
6 | 10345210334223501 |
7 | 441264340611454 |
oct | 55316555735235 |
9 | 12037517503021 |
10 | 3120121232029 |
11 | aa326610425a |
12 | 42484a354b91 |
13 | 1982c2b82ba9 |
14 | ab02c399b9b |
15 | 562651950a4 |
hex | 2d675b7ba9d |
3120121232029 has 2 divisors, whose sum is σ = 3120121232030. Its totient is φ = 3120121232028.
The previous prime is 3120121232009. The next prime is 3120121232083. The reversal of 3120121232029 is 9202321210213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1572771826404 + 1547349405625 = 1254102^2 + 1243925^2 .
It is a cyclic number.
It is not a de Polignac number, because 3120121232029 - 29 = 3120121231517 is a prime.
It is a super-3 number, since 3×31201212320293 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3120121231988 and 3120121232006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3120121232009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560060616014 + 1560060616015.
It is an arithmetic number, because the mean of its divisors is an integer number (1560060616015).
Almost surely, 23120121232029 is an apocalyptic number.
It is an amenable number.
3120121232029 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120121232029 is an equidigital number, since it uses as much as digits as its factorization.
3120121232029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 3120121232029 in words is "three trillion, one hundred twenty billion, one hundred twenty-one million, two hundred thirty-two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •