Base | Representation |
---|---|
bin | 1011001100100110110101… |
… | …1110100111000001000101 |
3 | 1121120221101121021002221202 |
4 | 2303021231132213001011 |
5 | 3103201331012323023 |
6 | 42103405420552245 |
7 | 2410312222655150 |
oct | 263115536470105 |
9 | 47527347232852 |
10 | 12311213011013 |
11 | 3a17179879254 |
12 | 1469bb43b2685 |
13 | 6b3c33607347 |
14 | 307c19ddcc97 |
15 | 165399be8128 |
hex | b326d7a7045 |
12311213011013 has 12 divisors (see below), whose sum is σ = 14849456772960. Its totient is φ = 9997075224936.
The previous prime is 12311213011007. The next prime is 12311213011057. The reversal of 12311213011013 is 31011031211321.
12311213011013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12311213011013 - 24 = 12311213010997 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 (12311213011093) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2435931983 + ... + 2435937036.
It is an arithmetic number, because the mean of its divisors is an integer number (1237454731080).
Almost surely, 212311213011013 is an apocalyptic number.
It is an amenable number.
12311213011013 is a deficient number, since it is larger than the sum of its proper divisors (2538243761947).
12311213011013 is an equidigital number, since it uses as much as digits as its factorization.
12311213011013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4871869064 (or 4871869045 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 12311213011013 its reverse (31011031211321), we get a palindrome (43322244222334).
The spelling of 12311213011013 in words is "twelve trillion, three hundred eleven billion, two hundred thirteen million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •