Base | Representation |
---|---|
bin | 1011001100100011011101… |
… | …0000000100110010000111 |
3 | 1121120212001012100111112211 |
4 | 2303020313100010302013 |
5 | 3103143000111343421 |
6 | 42103135241124251 |
7 | 2410250534654464 |
oct | 263106720046207 |
9 | 47525035314484 |
10 | 12310303231111 |
11 | 3a16852277136 |
12 | 146999b789687 |
13 | 6b3b19c98342 |
14 | 307b7125866b |
15 | 165344dd89e1 |
hex | b3237404c87 |
12310303231111 has 8 divisors (see below), whose sum is σ = 13120759504224. Its totient is φ = 11509438156800.
The previous prime is 12310303231103. The next prime is 12310303231147. The reversal of 12310303231111 is 11113230301321.
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 12310303231111 - 23 = 12310303231103 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 (12310303231711) 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, 2397797050 + ... + 2397802183.
It is an arithmetic number, because the mean of its divisors is an integer number (1640094938028).
Almost surely, 212310303231111 is an apocalyptic number.
12310303231111 is a deficient number, since it is larger than the sum of its proper divisors (810456273113).
12310303231111 is a wasteful number, since it uses less digits than its factorization.
12310303231111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4795599401.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 12310303231111 its reverse (11113230301321), we get a palindrome (23423533532432).
The spelling of 12310303231111 in words is "twelve trillion, three hundred ten billion, three hundred three million, two hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •