Base | Representation |
---|---|
bin | 111001011010111101… |
… | …1010110110000110001 |
3 | 102210021210000002202010 |
4 | 1302311323112300301 |
5 | 4010020144220423 |
6 | 132352021313133 |
7 | 11623524632622 |
oct | 1626573266061 |
9 | 383253002663 |
10 | 123311320113 |
11 | 48329030a13 |
12 | 1ba948657a9 |
13 | b822231097 |
14 | 5d7b02ba49 |
15 | 331aa42693 |
hex | 1cb5ed6c31 |
123311320113 has 4 divisors (see below), whose sum is σ = 164415093488. Its totient is φ = 82207546740.
The previous prime is 123311320091. The next prime is 123311320133. The reversal of 123311320113 is 311023113321.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 123311320113 - 26 = 123311320049 is a prime.
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 123311320113.
It is not an unprimeable number, because it can be changed into a prime (123311320133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20551886683 + ... + 20551886688.
It is an arithmetic number, because the mean of its divisors is an integer number (41103773372).
Almost surely, 2123311320113 is an apocalyptic number.
It is an amenable number.
123311320113 is a deficient number, since it is larger than the sum of its proper divisors (41103773375).
123311320113 is an equidigital number, since it uses as much as digits as its factorization.
123311320113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41103773374.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 123311320113 its reverse (311023113321), we get a palindrome (434334433434).
The spelling of 123311320113 in words is "one hundred twenty-three billion, three hundred eleven million, three hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •