Base | Representation |
---|---|
bin | 1011001100100011000100… |
… | …0110101101011111100011 |
3 | 1121120211210000022120021002 |
4 | 2303020301012231133203 |
5 | 3103142242212104443 |
6 | 42103121115022215 |
7 | 2410245143325113 |
oct | 263106106553743 |
9 | 47524700276232 |
10 | 12310200113123 |
11 | 3a167aa046060 |
12 | 146997113a96b |
13 | 6b3b01802593 |
14 | 307b61695043 |
15 | 16533ad1a2b8 |
hex | b32311ad7e3 |
12310200113123 has 16 divisors (see below), whose sum is σ = 14549949254016. Its totient is φ = 10287842893440.
The previous prime is 12310200113087. The next prime is 12310200113129. The reversal of 12310200113123 is 32131100201321.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 12310200113123 - 214 = 12310200096739 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12310200113095 and 12310200113104.
It is not an unprimeable number, because it can be changed into a prime (12310200113129) 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 15 ways as a sum of consecutive naturals, for example, 765456461 + ... + 765472542.
It is an arithmetic number, because the mean of its divisors is an integer number (909371828376).
Almost surely, 212310200113123 is an apocalyptic number.
12310200113123 is a deficient number, since it is larger than the sum of its proper divisors (2239749140893).
12310200113123 is a wasteful number, since it uses less digits than its factorization.
12310200113123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1530929074.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12310200113123 its reverse (32131100201321), we get a palindrome (44441300314444).
The spelling of 12310200113123 in words is "twelve trillion, three hundred ten billion, two hundred million, one hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •