Base | Representation |
---|---|
bin | 1011100101111101… |
… | …1000010101011110 |
3 | 22000212210112200110 |
4 | 2321133120111132 |
5 | 22333133323402 |
6 | 1232445110450 |
7 | 140055441444 |
oct | 27137302536 |
9 | 8025715613 |
10 | 3112011102 |
11 | 1357716002 |
12 | 72a258426 |
13 | 3a79720b5 |
14 | 217442b94 |
15 | 13331c56c |
hex | b97d855e |
3112011102 has 16 divisors (see below), whose sum is σ = 6551602560. Its totient is φ = 982740312.
The previous prime is 3112011101. The next prime is 3112011127. The reversal of 3112011102 is 2011102113.
It is a super-2 number, since 2×31120111022 = 19369226197942508808, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3112011101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13649058 + ... + 13649285.
It is an arithmetic number, because the mean of its divisors is an integer number (409475160).
Almost surely, 23112011102 is an apocalyptic number.
3112011102 is an abundant number, since it is smaller than the sum of its proper divisors (3439591458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3112011102 is a wasteful number, since it uses less digits than its factorization.
3112011102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27298367.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 3112011102 is about 55785.4022303326. The cubic root of 3112011102 is about 1459.9804685571.
Adding to 3112011102 its reverse (2011102113), we get a palindrome (5123113215).
It can be divided in two parts, 3112011 and 102, that added together give a palindrome (3112113).
The spelling of 3112011102 in words is "three billion, one hundred twelve million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •