Base | Representation |
---|---|
bin | 1011100101110010… |
… | …1111100111001101 |
3 | 22000211111102200120 |
4 | 2321130233213031 |
5 | 22332444220023 |
6 | 1232422215153 |
7 | 140046532554 |
oct | 27134574715 |
9 | 8024442616 |
10 | 3111320013 |
11 | 135729385a |
12 | 729b844b9 |
13 | 3a778c679 |
14 | 217302d9b |
15 | 1332328e3 |
hex | b972f9cd |
3111320013 has 8 divisors (see below), whose sum is σ = 4291476000. Its totient is φ = 2002688688.
The previous prime is 3111320011. The next prime is 3111320021. The reversal of 3111320013 is 3100231113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3111320013 - 21 = 3111320011 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3111319974 and 3111320001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3111320011) 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, 17881063 + ... + 17881236.
It is an arithmetic number, because the mean of its divisors is an integer number (536434500).
Almost surely, 23111320013 is an apocalyptic number.
It is an amenable number.
3111320013 is a deficient number, since it is larger than the sum of its proper divisors (1180155987).
3111320013 is a wasteful number, since it uses less digits than its factorization.
3111320013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35762331.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 3111320013 is about 55779.2077121933. The cubic root of 3111320013 is about 1459.8723872011.
Adding to 3111320013 its reverse (3100231113), we get a palindrome (6211551126).
Subtracting from 3111320013 its reverse (3100231113), we obtain a square (11088900 = 33302).
The spelling of 3111320013 in words is "three billion, one hundred eleven million, three hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •