Base | Representation |
---|---|
bin | 1101110001110110101110… |
… | …11001001100011111111110 |
3 | 10222021200101220121110021111 |
4 | 12320323113121030133332 |
5 | 12432420020112342342 |
6 | 144235434401152234 |
7 | 6245061001024621 |
oct | 670732731143776 |
9 | 128250356543244 |
10 | 30300313012222 |
11 | 972232184a040 |
12 | 34944a162b67a |
13 | 13ba3cc073596 |
14 | 76a785ccbdb8 |
15 | 3782a9bb7217 |
hex | 1b8ed764c7fe |
30300313012222 has 32 divisors (see below), whose sum is σ = 49623665382144. Its totient is φ = 13761391464000.
The previous prime is 30300313012219. The next prime is 30300313012243. The reversal of 30300313012222 is 22221031300303.
It is a super-2 number, since 2×303003130122222 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 30300313012193 and 30300313012202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 162163383 + ... + 162350125.
It is an arithmetic number, because the mean of its divisors is an integer number (1550739543192).
Almost surely, 230300313012222 is an apocalyptic number.
30300313012222 is a deficient number, since it is larger than the sum of its proper divisors (19323352369922).
30300313012222 is a wasteful number, since it uses less digits than its factorization.
30300313012222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192864.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 30300313012222 its reverse (22221031300303), we get a palindrome (52521344312525).
The spelling of 30300313012222 in words is "thirty trillion, three hundred billion, three hundred thirteen million, twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •