Base | Representation |
---|---|
bin | 111001010101100100… |
… | …0011100101111011101 |
3 | 102202211011012101220122 |
4 | 1302223020130233131 |
5 | 4004132312444401 |
6 | 132322031324325 |
7 | 11616165312653 |
oct | 1625310345735 |
9 | 382734171818 |
10 | 123130203101 |
11 | 48245876034 |
12 | 1ba440806a5 |
13 | b7c3858959 |
14 | 5d60d62dd3 |
15 | 3309bb821b |
hex | 1cab21cbdd |
123130203101 has 2 divisors, whose sum is σ = 123130203102. Its totient is φ = 123130203100.
The previous prime is 123130203083. The next prime is 123130203137. The reversal of 123130203101 is 101302031321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97251046201 + 25879156900 = 311851^2 + 160870^2 .
It is a cyclic number.
It is not a de Polignac number, because 123130203101 - 26 = 123130203037 is a prime.
It is a super-2 number, since 2×1231302031012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 123130203101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123130203901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61565101550 + 61565101551.
It is an arithmetic number, because the mean of its divisors is an integer number (61565101551).
Almost surely, 2123130203101 is an apocalyptic number.
It is an amenable number.
123130203101 is a deficient number, since it is larger than the sum of its proper divisors (1).
123130203101 is an equidigital number, since it uses as much as digits as its factorization.
123130203101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 123130203101 its reverse (101302031321), we get a palindrome (224432234422).
The spelling of 123130203101 in words is "one hundred twenty-three billion, one hundred thirty million, two hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •