Base | Representation |
---|---|
bin | 1011010010101001… |
… | …1011001001001111 |
3 | 21211020101202221010 |
4 | 2310222123021033 |
5 | 22201420120421 |
6 | 1220433140303 |
7 | 135053150220 |
oct | 26452331117 |
9 | 7736352833 |
10 | 3031020111 |
11 | 1315a282a9 |
12 | 7070ba693 |
13 | 393c55932 |
14 | 20a79d247 |
15 | 12b170076 |
hex | b4a9b24f |
3031020111 has 8 divisors (see below), whose sum is σ = 4618697344. Its totient is φ = 1732011480.
The previous prime is 3031020103. The next prime is 3031020119. The reversal of 3031020111 is 1110201303.
It is an interprime number because it is at equal distance from previous prime (3031020103) and next prime (3031020119).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3031020111 - 23 = 3031020103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3031020119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72167125 + ... + 72167166.
It is an arithmetic number, because the mean of its divisors is an integer number (577337168).
Almost surely, 23031020111 is an apocalyptic number.
3031020111 is a deficient number, since it is larger than the sum of its proper divisors (1587677233).
3031020111 is a wasteful number, since it uses less digits than its factorization.
3031020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144334301.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 3031020111 is about 55054.7010799260. The cubic root of 3031020111 is about 1447.2035060203.
Adding to 3031020111 its reverse (1110201303), we get a palindrome (4141221414).
The spelling of 3031020111 in words is "three billion, thirty-one million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •