Base | Representation |
---|---|
bin | 1101101111001110111001… |
… | …11010100011100001010001 |
3 | 10221222001211120101202112201 |
4 | 12313213130322203201101 |
5 | 12424431003100031004 |
6 | 144130213545323201 |
7 | 6235421125252045 |
oct | 667473472434121 |
9 | 127861746352481 |
10 | 30210211330129 |
11 | 9698095798766 |
12 | 347ab36796501 |
13 | 13b1a7016bcac |
14 | 7662796c2025 |
15 | 375c849526a4 |
hex | 1b79dcea3851 |
30210211330129 has 2 divisors, whose sum is σ = 30210211330130. Its totient is φ = 30210211330128.
The previous prime is 30210211330109. The next prime is 30210211330139. The reversal of 30210211330129 is 92103311201203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19655035560000 + 10555175770129 = 4433400^2 + 3248873^2 .
It is a cyclic number.
It is not a de Polignac number, because 30210211330129 - 25 = 30210211330097 is a prime.
It is a super-2 number, since 2×302102113301292 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30210211330097 and 30210211330106.
It is not a weakly prime, because it can be changed into another prime (30210211330109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15105105665064 + 15105105665065.
It is an arithmetic number, because the mean of its divisors is an integer number (15105105665065).
Almost surely, 230210211330129 is an apocalyptic number.
It is an amenable number.
30210211330129 is a deficient number, since it is larger than the sum of its proper divisors (1).
30210211330129 is an equidigital number, since it uses as much as digits as its factorization.
30210211330129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 30210211330129 in words is "thirty trillion, two hundred ten billion, two hundred eleven million, three hundred thirty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •