Base | Representation |
---|---|
bin | 1011001100101010111011… |
… | …1011100010000101001101 |
3 | 1121121001020010112102100011 |
4 | 2303022232323202011031 |
5 | 3103211103121041023 |
6 | 42104110405033221 |
7 | 2410351355451613 |
oct | 263125673420515 |
9 | 47531203472304 |
10 | 12312311112013 |
11 | 3a17692706840 |
12 | 146a2600b5811 |
13 | 6b4079c71853 |
14 | 307cc1ba56b3 |
15 | 16541130650d |
hex | b32aeee214d |
12312311112013 has 8 divisors (see below), whose sum is σ = 13501934701056. Its totient is φ = 11134407952800.
The previous prime is 12312311112007. The next prime is 12312311112071. The reversal of 12312311112013 is 31021111321321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12312311112013 - 29 = 12312311111501 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 (12312311112083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2930105256 + ... + 2930109457.
It is an arithmetic number, because the mean of its divisors is an integer number (1687741837632).
Almost surely, 212312311112013 is an apocalyptic number.
It is an amenable number.
12312311112013 is a deficient number, since it is larger than the sum of its proper divisors (1189623589043).
12312311112013 is a wasteful number, since it uses less digits than its factorization.
12312311112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5860214915.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 12312311112013 its reverse (31021111321321), we get a palindrome (43333422433334).
The spelling of 12312311112013 in words is "twelve trillion, three hundred twelve billion, three hundred eleven million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.241 sec. • engine limits •