Base | Representation |
---|---|
bin | 101011110101010000100… |
… | …001110010111011001001 |
3 | 101122221211001001010111102 |
4 | 223311100201302323021 |
5 | 343322312004023423 |
6 | 10223430015511145 |
7 | 430422135000254 |
oct | 53652041627311 |
9 | 11587731033442 |
10 | 3012123111113 |
11 | a61485a74576 |
12 | 407929b284b5 |
13 | 18b07133a72c |
14 | a5b0500009b |
15 | 53543bd1c28 |
hex | 2bd50872ec9 |
3012123111113 has 8 divisors (see below), whose sum is σ = 3050552551680. Its totient is φ = 2973701203200.
The previous prime is 3012123111103. The next prime is 3012123111139. The reversal of 3012123111113 is 3111113212103.
3012123111113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3012123111113 - 228 = 3011854675657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3012123111103) 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, 1076120 + ... + 2679977.
It is an arithmetic number, because the mean of its divisors is an integer number (381319068960).
Almost surely, 23012123111113 is an apocalyptic number.
It is an amenable number.
3012123111113 is a deficient number, since it is larger than the sum of its proper divisors (38429440567).
3012123111113 is a wasteful number, since it uses less digits than its factorization.
3012123111113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3766327.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 3012123111113 its reverse (3111113212103), we get a palindrome (6123236323216).
The spelling of 3012123111113 in words is "three trillion, twelve billion, one hundred twenty-three million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •