Base | Representation |
---|---|
bin | 1110101011011… |
… | …01000101100101 |
3 | 22120200122220021 |
4 | 13111231011211 |
5 | 223010131323 |
6 | 20115035141 |
7 | 3023406133 |
oct | 725550545 |
9 | 276618807 |
10 | 123130213 |
11 | 6355a608 |
12 | 3529bab1 |
13 | 1c68191b |
14 | 124d2753 |
15 | ac2305d |
hex | 756d165 |
123130213 has 2 divisors, whose sum is σ = 123130214. Its totient is φ = 123130212.
The previous prime is 123130207. The next prime is 123130219. The reversal of 123130213 is 312031321.
It is a balanced prime because it is at equal distance from previous prime (123130207) and next prime (123130219).
It can be written as a sum of positive squares in only one way, i.e., 121837444 + 1292769 = 11038^2 + 1137^2 .
It is a cyclic number.
It is not a de Polignac number, because 123130213 - 25 = 123130181 is a prime.
It is a super-3 number, since 3×1231302133 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123130219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61565106 + 61565107.
It is an arithmetic number, because the mean of its divisors is an integer number (61565107).
Almost surely, 2123130213 is an apocalyptic number.
It is an amenable number.
123130213 is a deficient number, since it is larger than the sum of its proper divisors (1).
123130213 is an equidigital number, since it uses as much as digits as its factorization.
123130213 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 16.
The square root of 123130213 is about 11096.4054089601. The cubic root of 123130213 is about 497.4944157349.
Adding to 123130213 its reverse (312031321), we get a palindrome (435161534).
The spelling of 123130213 in words is "one hundred twenty-three million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •