Base | Representation |
---|---|
bin | 1011100011100101… |
… | …0001100111100001 |
3 | 22000012000001100220 |
4 | 2320321101213201 |
5 | 22323104201423 |
6 | 1231451033253 |
7 | 136604516151 |
oct | 27071214741 |
9 | 8005001326 |
10 | 3102022113 |
11 | 1352013143 |
12 | 726a3b829 |
13 | 3a5885558 |
14 | 215da2761 |
15 | 1324e79e3 |
hex | b8e519e1 |
3102022113 has 8 divisors (see below), whose sum is σ = 4379325408. Its totient is φ = 1946366784.
The previous prime is 3102022111. The next prime is 3102022129. The reversal of 3102022113 is 3112202013.
3102022113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3102022113 - 21 = 3102022111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3102022092 and 3102022101.
It is not an unprimeable number, because it can be changed into a prime (3102022111) 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, 30411931 + ... + 30412032.
It is an arithmetic number, because the mean of its divisors is an integer number (547415676).
Almost surely, 23102022113 is an apocalyptic number.
It is an amenable number.
3102022113 is a deficient number, since it is larger than the sum of its proper divisors (1277303295).
3102022113 is a wasteful number, since it uses less digits than its factorization.
3102022113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60823983.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 3102022113 is about 55695.7997787984. The cubic root of 3102022113 is about 1458.4167037384.
Adding to 3102022113 its reverse (3112202013), we get a palindrome (6214224126).
The spelling of 3102022113 in words is "three billion, one hundred two million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •