Base | Representation |
---|---|
bin | 1011111111101111… |
… | …0000001010001101 |
3 | 22022102012122020220 |
4 | 2333323300022031 |
5 | 23043322041023 |
6 | 1251310101553 |
7 | 142540333446 |
oct | 27773601215 |
9 | 8272178226 |
10 | 3220112013 |
11 | 140273a8a8 |
12 | 75a4aa8b9 |
13 | 3c4190c31 |
14 | 2279422cd |
15 | 13ca723e3 |
hex | bfef028d |
3220112013 has 8 divisors (see below), whose sum is σ = 4294925376. Its totient is φ = 2146020000.
The previous prime is 3220111943. The next prime is 3220112053. The reversal of 3220112013 is 3102110223.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3220112013 - 210 = 3220110989 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3220111983 and 3220112001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3220112053) 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, 169833 + ... + 187838.
It is an arithmetic number, because the mean of its divisors is an integer number (536865672).
Almost surely, 23220112013 is an apocalyptic number.
It is an amenable number.
3220112013 is a deficient number, since it is larger than the sum of its proper divisors (1074813363).
3220112013 is a wasteful number, since it uses less digits than its factorization.
3220112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 360675.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 3220112013 is about 56746.0308127361. The cubic root of 3220112013 is about 1476.6933746056.
Adding to 3220112013 its reverse (3102110223), we get a palindrome (6322222236).
The spelling of 3220112013 in words is "three billion, two hundred twenty million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •