Base | Representation |
---|---|
bin | 111001100100110100… |
… | …1000010000100110111 |
3 | 102211010211100111002201 |
4 | 1303021221002010313 |
5 | 4011204331423421 |
6 | 132444514245331 |
7 | 11634652115242 |
oct | 1631151020467 |
9 | 384124314081 |
10 | 123642061111 |
11 | 484887a1588 |
12 | 1bb67586847 |
13 | b87590320a |
14 | 5dacd24259 |
15 | 3339ac4b91 |
hex | 1cc9a42137 |
123642061111 has 2 divisors, whose sum is σ = 123642061112. Its totient is φ = 123642061110.
The previous prime is 123642061087. The next prime is 123642061129. The reversal of 123642061111 is 111160246321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123642061111 - 25 = 123642061079 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123642061111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123642061141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61821030555 + 61821030556.
It is an arithmetic number, because the mean of its divisors is an integer number (61821030556).
Almost surely, 2123642061111 is an apocalyptic number.
123642061111 is a deficient number, since it is larger than the sum of its proper divisors (1).
123642061111 is an equidigital number, since it uses as much as digits as its factorization.
123642061111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 123642061111 in words is "one hundred twenty-three billion, six hundred forty-two million, sixty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •