Base | Representation |
---|---|
bin | 1011100101101110… |
… | …0110101001000001 |
3 | 22000210221020200111 |
4 | 2321123212221001 |
5 | 22332410133441 |
6 | 1232411551321 |
7 | 140044146265 |
oct | 27133465101 |
9 | 8023836614 |
10 | 3111021121 |
11 | 13570aa23a |
12 | 729a5b541 |
13 | 3a76b6600 |
14 | 2172660a5 |
15 | 1331c4081 |
hex | b96e6a41 |
3111021121 has 12 divisors (see below), whose sum is σ = 3377696880. Its totient is φ = 2864075760.
The previous prime is 3111021119. The next prime is 3111021127. The reversal of 3111021121 is 1211201113.
It is a happy number.
3111021121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3111021121 - 21 = 3111021119 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3111021127) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 39766 + ... + 88336.
It is an arithmetic number, because the mean of its divisors is an integer number (281474740).
Almost surely, 23111021121 is an apocalyptic number.
It is an amenable number.
3111021121 is a deficient number, since it is larger than the sum of its proper divisors (266675759).
3111021121 is a wasteful number, since it uses less digits than its factorization.
3111021121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48976 (or 48963 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 3111021121 is about 55776.5284057730. The cubic root of 3111021121 is about 1459.8256376812.
Adding to 3111021121 its reverse (1211201113), we get a palindrome (4322222234).
The spelling of 3111021121 in words is "three billion, one hundred eleven million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •