Base | Representation |
---|---|
bin | 100001101001100110101… |
… | …000100000011101101011 |
3 | 22012001202010110122211111 |
4 | 201221212220200131223 |
5 | 300341311030100021 |
6 | 4530150343411151 |
7 | 326031532145044 |
oct | 41514650403553 |
9 | 8161663418744 |
10 | 2312414300011 |
11 | 811764651462 |
12 | 3141b2a53ab7 |
13 | 13a0a1304c1a |
14 | 7dcc86578cb |
15 | 402404978e1 |
hex | 21a66a2076b |
2312414300011 has 4 divisors (see below), whose sum is σ = 2312424987624. Its totient is φ = 2312403612400.
The previous prime is 2312414299963. The next prime is 2312414300033. The reversal of 2312414300011 is 1100034142132.
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 2312414300011 - 27 = 2312414299883 is a prime.
It is a super-2 number, since 2×23124143000112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2312414300041) 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 3 ways as a sum of consecutive naturals, for example, 5012410 + ... + 5454271.
It is an arithmetic number, because the mean of its divisors is an integer number (578106246906).
Almost surely, 22312414300011 is an apocalyptic number.
2312414300011 is a deficient number, since it is larger than the sum of its proper divisors (10687613).
2312414300011 is a wasteful number, since it uses less digits than its factorization.
2312414300011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10687612.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2312414300011 its reverse (1100034142132), we get a palindrome (3412448442143).
The spelling of 2312414300011 in words is "two trillion, three hundred twelve billion, four hundred fourteen million, three hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •