Base | Representation |
---|---|
bin | 11100000010001010… |
… | …101010100100100000 |
3 | 2212200210120101201220 |
4 | 130002022222210200 |
5 | 443121341340222 |
6 | 21454523255040 |
7 | 2113635211113 |
oct | 340212524440 |
9 | 85623511656 |
10 | 30101121312 |
11 | 11847330a69 |
12 | 5a0097a480 |
13 | 2ab930c0b2 |
14 | 1657a4c57a |
15 | bb2950b5c |
hex | 7022aa920 |
30101121312 has 48 divisors (see below), whose sum is σ = 79618648032. Its totient is φ = 9957109760.
The previous prime is 30101121307. The next prime is 30101121313. The reversal of 30101121312 is 21312110103.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 30101121291 and 30101121300.
It is not an unprimeable number, because it can be changed into a prime (30101121313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1184193 + ... + 1209344.
It is an arithmetic number, because the mean of its divisors is an integer number (1658721834).
Almost surely, 230101121312 is an apocalyptic number.
30101121312 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30101121312 is an abundant number, since it is smaller than the sum of its proper divisors (49517526720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30101121312 is a wasteful number, since it uses less digits than its factorization.
30101121312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2393681 (or 2393673 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 30101121312 its reverse (21312110103), we get a palindrome (51413231415).
The spelling of 30101121312 in words is "thirty billion, one hundred one million, one hundred twenty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •