Base | Representation |
---|---|
bin | 1101101001011011110110… |
… | …00000110100100101100010 |
3 | 10221021000122012201102010020 |
4 | 12310231323000310211202 |
5 | 12413200012034410424 |
6 | 143454510242014310 |
7 | 6215136364443165 |
oct | 664557300644542 |
9 | 127230565642106 |
10 | 30011000310114 |
11 | 962065932093a |
12 | 34483bb347396 |
13 | 1399043444aa5 |
14 | 75a77c2dbadc |
15 | 3709c58ca079 |
hex | 1b4b7b034962 |
30011000310114 has 8 divisors (see below), whose sum is σ = 60022000620240. Its totient is φ = 10003666770036.
The previous prime is 30011000310103. The next prime is 30011000310173. The reversal of 30011000310114 is 41101300011003.
It is a sphenic number, since it is the product of 3 distinct primes.
30011000310114 is an admirable number.
It is a super-2 number, since 2×300110003101142 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30011000310093 and 30011000310102.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2500916692504 + ... + 2500916692515.
It is an arithmetic number, because the mean of its divisors is an integer number (7502750077530).
Almost surely, 230011000310114 is an apocalyptic number.
30011000310114 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30011000310114 is a wasteful number, since it uses less digits than its factorization.
30011000310114 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5001833385024.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 30011000310114 its reverse (41101300011003), we get a palindrome (71112300321117).
The spelling of 30011000310114 in words is "thirty trillion, eleven billion, three hundred ten thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •