Base | Representation |
---|---|
bin | 1101101001001001001111… |
… | …01010111100110100001011 |
3 | 10221020001212010012110010101 |
4 | 12310210213222330310023 |
5 | 12413014033101230011 |
6 | 143450135200430231 |
7 | 6214334022362524 |
oct | 664444752746413 |
9 | 127201763173111 |
10 | 30001012133131 |
11 | 96173a3251716 |
12 | 3446492318377 |
13 | 1398111036bb0 |
14 | 75a0b197584b |
15 | 3705ddaa52c1 |
hex | 1b4927abcd0b |
30001012133131 has 16 divisors (see below), whose sum is σ = 32971176352800. Its totient is φ = 27130567714560.
The previous prime is 30001012133119. The next prime is 30001012133159. The reversal of 30001012133131 is 13133121010003.
It is a cyclic number.
It is not a de Polignac number, because 30001012133131 - 215 = 30001012100363 is a prime.
It is a super-2 number, since 2×300010121331312 (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 = 30001012133099 and 30001012133108.
It is not an unprimeable number, because it can be changed into a prime (30001012133831) 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, 105943465 + ... + 106226266.
It is an arithmetic number, because the mean of its divisors is an integer number (2060698522050).
Almost surely, 230001012133131 is an apocalyptic number.
30001012133131 is a deficient number, since it is larger than the sum of its proper divisors (2970164219669).
30001012133131 is a wasteful number, since it uses less digits than its factorization.
30001012133131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212169966.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 30001012133131 its reverse (13133121010003), we get a palindrome (43134133143134).
The spelling of 30001012133131 in words is "thirty trillion, one billion, twelve million, one hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •