Base | Representation |
---|---|
bin | 1101101100101010100110… |
… | …01111000101101001000011 |
3 | 10221122122011010012011000102 |
4 | 12312111103033011221003 |
5 | 12422004330020023133 |
6 | 144021505015513015 |
7 | 6226146202255103 |
oct | 666252317055103 |
9 | 127578133164012 |
10 | 30122002111043 |
11 | 966373aa048a7 |
12 | 3465a1968876b |
13 | 13a665335c7bb |
14 | 761cac57b203 |
15 | 37382090c7e8 |
hex | 1b65533c5a43 |
30122002111043 has 16 divisors (see below), whose sum is σ = 32913919104000. Its totient is φ = 27490602817440.
The previous prime is 30122002111027. The next prime is 30122002111063. The reversal of 30122002111043 is 34011120022103.
It is a cyclic number.
It is not a de Polignac number, because 30122002111043 - 24 = 30122002111027 is a prime.
It is a super-2 number, since 2×301220021110432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30122002111013) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 389567393 + ... + 389644706.
It is an arithmetic number, because the mean of its divisors is an integer number (2057119944000).
Almost surely, 230122002111043 is an apocalyptic number.
30122002111043 is a deficient number, since it is larger than the sum of its proper divisors (2791916992957).
30122002111043 is a wasteful number, since it uses less digits than its factorization.
30122002111043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 779212202.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 30122002111043 its reverse (34011120022103), we get a palindrome (64133122133146).
The spelling of 30122002111043 in words is "thirty trillion, one hundred twenty-two billion, two million, one hundred eleven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •