Base | Representation |
---|---|
bin | 1101110001111000000100… |
… | …10011110001011110110010 |
3 | 10222021202021002102012002102 |
4 | 12320330002103301132302 |
5 | 12432423003422323442 |
6 | 144240034041220402 |
7 | 6245114562642026 |
oct | 670740223613662 |
9 | 128252232365072 |
10 | 30301033011122 |
11 | 9722661208955 |
12 | 3494662791702 |
13 | 13ba4b5295733 |
14 | 76a813790386 |
15 | 3782eceda232 |
hex | 1b8f024f17b2 |
30301033011122 has 8 divisors (see below), whose sum is σ = 45451605480876. Its totient is φ = 15150497850832.
The previous prime is 30301033011089. The next prime is 30301033011173. The reversal of 30301033011122 is 22111033010303.
It can be written as a sum of positive squares in 2 ways, for example, as 26672049921001 + 3628983090121 = 5164499^2 + 1904989^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×303010330111222 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30301033011094 and 30301033011103.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7199933 + ... + 10603824.
Almost surely, 230301033011122 is an apocalyptic number.
30301033011122 is a deficient number, since it is larger than the sum of its proper divisors (15150572469754).
30301033011122 is a wasteful number, since it uses less digits than its factorization.
30301033011122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18654732.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 30301033011122 its reverse (22111033010303), we get a palindrome (52412066021425).
The spelling of 30301033011122 in words is "thirty trillion, three hundred one billion, thirty-three million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •