Base | Representation |
---|---|
bin | 1101101100100110110111… |
… | …11010000001111001111101 |
3 | 10221122102222121001112220211 |
4 | 12312103123322001321331 |
5 | 12421441230011231023 |
6 | 144020534221512421 |
7 | 6226045452415063 |
oct | 666233372017175 |
9 | 127572877045824 |
10 | 30120000102013 |
11 | 9662902915888 |
12 | 346555b112711 |
13 | 13a63c4660b83 |
14 | 761b5c71c033 |
15 | 373754c9ea0d |
hex | 1b64dbe81e7d |
30120000102013 has 16 divisors (see below), whose sum is σ = 30303709962624. Its totient is φ = 29936756640960.
The previous prime is 30120000101927. The next prime is 30120000102029. The reversal of 30120000102013 is 31020100002103.
It is a cyclic number.
It is not a de Polignac number, because 30120000102013 - 221 = 30119998004861 is a prime.
It is a super-2 number, since 2×301200001020132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30120000101984 and 30120000102002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30120000102053) 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, 849366103 + ... + 849401563.
It is an arithmetic number, because the mean of its divisors is an integer number (1893981872664).
Almost surely, 230120000102013 is an apocalyptic number.
It is an amenable number.
30120000102013 is a deficient number, since it is larger than the sum of its proper divisors (183709860611).
30120000102013 is a wasteful number, since it uses less digits than its factorization.
30120000102013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41892.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 30120000102013 its reverse (31020100002103), we get a palindrome (61140100104116).
The spelling of 30120000102013 in words is "thirty trillion, one hundred twenty billion, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •