Base | Representation |
---|---|
bin | 1101110010110010010101… |
… | …00100000011100100001001 |
3 | 10222101201222211121100202202 |
4 | 12321121022210003210021 |
5 | 12433431032330310441 |
6 | 144302245412005545 |
7 | 6250302630023030 |
oct | 671311244034411 |
9 | 128351884540682 |
10 | 30332310010121 |
11 | 973495126a159 |
12 | 349a7313008b5 |
13 | 13c042b0a1432 |
14 | 76c13d64d717 |
15 | 37902dcae19b |
hex | 1b964a903909 |
30332310010121 has 16 divisors (see below), whose sum is σ = 34873535827200. Its totient is φ = 25843097977920.
The previous prime is 30332310010091. The next prime is 30332310010129. The reversal of 30332310010121 is 12101001323303.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30332310010121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30332310010093 and 30332310010102.
It is not an unprimeable number, because it can be changed into a prime (30332310010129) 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 in 15 ways as a sum of consecutive naturals, for example, 131679155 + ... + 131909303.
It is an arithmetic number, because the mean of its divisors is an integer number (2179595989200).
Almost surely, 230332310010121 is an apocalyptic number.
It is an amenable number.
30332310010121 is a deficient number, since it is larger than the sum of its proper divisors (4541225817079).
30332310010121 is a wasteful number, since it uses less digits than its factorization.
30332310010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343064.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 30332310010121 its reverse (12101001323303), we get a palindrome (42433311333424).
The spelling of 30332310010121 in words is "thirty trillion, three hundred thirty-two billion, three hundred ten million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.155 sec. • engine limits •