Base | Representation |
---|---|
bin | 10100100110011110… |
… | …001111110111111111 |
3 | 2010002121020200002112 |
4 | 110212132033313333 |
5 | 330300244100111 |
6 | 14054550444235 |
7 | 1412106306434 |
oct | 244636176777 |
9 | 63077220075 |
10 | 22120300031 |
11 | 94213728a5 |
12 | 435406367b |
13 | 2116a5263b |
14 | 10dbb37b8b |
15 | 896e92e8b |
hex | 52678fdff |
22120300031 has 8 divisors (see below), whose sum is σ = 22220126544. Its totient is φ = 22020672960.
The previous prime is 22120300021. The next prime is 22120300051. The reversal of 22120300031 is 13000302122.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22120300031 - 218 = 22120037887 is a prime.
It is a super-3 number, since 3×221203000313 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22120299979 and 22120300015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22120300021) 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, 174731 + ... + 273443.
It is an arithmetic number, because the mean of its divisors is an integer number (2777515818).
Almost surely, 222120300031 is an apocalyptic number.
22120300031 is a deficient number, since it is larger than the sum of its proper divisors (99826513).
22120300031 is an equidigital number, since it uses as much as digits as its factorization.
22120300031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99721.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 22120300031 its reverse (13000302122), we get a palindrome (35120602153).
The spelling of 22120300031 in words is "twenty-two billion, one hundred twenty million, three hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •