Base | Representation |
---|---|
bin | 1101101001011010100111… |
… | …01101110101011000101111 |
3 | 10221020221221021011001210110 |
4 | 12310231103231311120233 |
5 | 12413142134300134411 |
6 | 143454321011111103 |
7 | 6215114140541154 |
oct | 664552355653057 |
9 | 127227837131713 |
10 | 30010341021231 |
11 | 962035015839a |
12 | 34482565a2493 |
13 | 1398c6998ab1c |
14 | 75a71892022b |
15 | 370987a9a2a6 |
hex | 1b4b53b7562f |
30010341021231 has 16 divisors (see below), whose sum is σ = 40314145766400. Its totient is φ = 19857276563040.
The previous prime is 30010341021191. The next prime is 30010341021239. The reversal of 30010341021231 is 13212014301003.
It is not a de Polignac number, because 30010341021231 - 27 = 30010341021103 is a prime.
It is a super-2 number, since 2×300103410212312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30010341021198 and 30010341021207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30010341021239) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69963156 + ... + 70390793.
It is an arithmetic number, because the mean of its divisors is an integer number (2519634110400).
Almost surely, 230010341021231 is an apocalyptic number.
30010341021231 is a deficient number, since it is larger than the sum of its proper divisors (10303804745169).
30010341021231 is a wasteful number, since it uses less digits than its factorization.
30010341021231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140354486.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 30010341021231 its reverse (13212014301003), we get a palindrome (43222355322234).
The spelling of 30010341021231 in words is "thirty trillion, ten billion, three hundred forty-one million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •