Base | Representation |
---|---|
bin | 1011001100100110100100… |
… | …1011111100101011001011 |
3 | 1121120221012120210002022010 |
4 | 2303021221023330223023 |
5 | 3103201204044310443 |
6 | 42103354325431003 |
7 | 2410310356656054 |
oct | 263115113745313 |
9 | 47527176702263 |
10 | 12311141010123 |
11 | 3a1714217098a |
12 | 1469b9426b463 |
13 | 6b3c21717b77 |
14 | 307c1061972b |
15 | 165393724733 |
hex | b32692fcacb |
12311141010123 has 16 divisors (see below), whose sum is σ = 16494606809600. Its totient is φ = 8167621793760.
The previous prime is 12311141010079. The next prime is 12311141010139. The reversal of 12311141010123 is 32101014111321.
It is a happy number.
It is not a de Polignac number, because 12311141010123 - 26 = 12311141010059 is a prime.
It is a super-2 number, since 2×123111410101232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12311141010123.
It is not an unprimeable number, because it can be changed into a prime (12311141010173) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8115868 + ... + 9512601.
It is an arithmetic number, because the mean of its divisors is an integer number (1030912925600).
Almost surely, 212311141010123 is an apocalyptic number.
12311141010123 is a deficient number, since it is larger than the sum of its proper divisors (4183465799477).
12311141010123 is a wasteful number, since it uses less digits than its factorization.
12311141010123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17629602.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 12311141010123 its reverse (32101014111321), we get a palindrome (44412155121444).
The spelling of 12311141010123 in words is "twelve trillion, three hundred eleven billion, one hundred forty-one million, ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •