Base | Representation |
---|---|
bin | 11100000010011001011000… |
… | …110111100001111100010001 |
3 | 121011121022200001112121100001 |
4 | 130002121120313201330101 |
5 | 112130302341004120423 |
6 | 1114131455523330001 |
7 | 34654565542141246 |
oct | 3402313067417421 |
9 | 534538601477301 |
10 | 123310002020113 |
11 | 36321529500a07 |
12 | 119b637a220901 |
13 | 53a611100226c |
14 | 22643435d55cd |
15 | e3c8996b4cad |
hex | 702658de1f11 |
123310002020113 has 2 divisors, whose sum is σ = 123310002020114. Its totient is φ = 123310002020112.
The previous prime is 123310002020089. The next prime is 123310002020167. The reversal of 123310002020113 is 311020200013321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101447943746769 + 21862058273344 = 10072137^2 + 4675688^2 .
It is an emirp because it is prime and its reverse (311020200013321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123310002020113 - 29 = 123310002019601 is a prime.
It is not a weakly prime, because it can be changed into another prime (123310002023113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61655001010056 + 61655001010057.
It is an arithmetic number, because the mean of its divisors is an integer number (61655001010057).
Almost surely, 2123310002020113 is an apocalyptic number.
It is an amenable number.
123310002020113 is a deficient number, since it is larger than the sum of its proper divisors (1).
123310002020113 is an equidigital number, since it uses as much as digits as its factorization.
123310002020113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 123310002020113 its reverse (311020200013321), we get a palindrome (434330202033434).
The spelling of 123310002020113 in words is "one hundred twenty-three trillion, three hundred ten billion, two million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •