Base | Representation |
---|---|
bin | 1011001100100011100001… |
… | …1000000100010000001111 |
3 | 1121120212002111212022100012 |
4 | 2303020320120010100033 |
5 | 3103143014424301221 |
6 | 42103141153423435 |
7 | 2410251154245461 |
oct | 263107030042017 |
9 | 47525074768305 |
10 | 12310322103311 |
11 | 3a168619970a1 |
12 | 14699a5b6ab7b |
13 | 6b3b20b7531b |
14 | 307b7396c131 |
15 | 1653468b565b |
hex | b323860440f |
12310322103311 has 4 divisors (see below), whose sum is σ = 12310347126000. Its totient is φ = 12310297080624.
The previous prime is 12310322103301. The next prime is 12310322103329. The reversal of 12310322103311 is 11330122301321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12310322103311 - 214 = 12310322086927 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 (12310322103301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11758286 + ... + 12762363.
It is an arithmetic number, because the mean of its divisors is an integer number (3077586781500).
Almost surely, 212310322103311 is an apocalyptic number.
12310322103311 is a deficient number, since it is larger than the sum of its proper divisors (25022689).
12310322103311 is an equidigital number, since it uses as much as digits as its factorization.
12310322103311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25022688.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12310322103311 its reverse (11330122301321), we get a palindrome (23640444404632).
The spelling of 12310322103311 in words is "twelve trillion, three hundred ten billion, three hundred twenty-two million, one hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •