Base | Representation |
---|---|
bin | 111001011110100001… |
… | …0000011000111000001 |
3 | 102210121002021211120122 |
4 | 1302331002003013001 |
5 | 4010241202441022 |
6 | 132411520150025 |
7 | 11626503032156 |
oct | 1627502030701 |
9 | 383532254518 |
10 | 123430515137 |
11 | 4838a3429a6 |
12 | 1bb08768315 |
13 | b840b35797 |
14 | 5d8cbb822d |
15 | 3326239742 |
hex | 1cbd0831c1 |
123430515137 has 2 divisors, whose sum is σ = 123430515138. Its totient is φ = 123430515136.
The previous prime is 123430515133. The next prime is 123430515149. The reversal of 123430515137 is 731515034321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 122247430321 + 1183084816 = 349639^2 + 34396^2 .
It is a cyclic number.
It is not a de Polignac number, because 123430515137 - 22 = 123430515133 is a prime.
It is a super-2 number, since 2×1234305151372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123430515097 and 123430515106.
It is not a weakly prime, because it can be changed into another prime (123430515133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61715257568 + 61715257569.
It is an arithmetic number, because the mean of its divisors is an integer number (61715257569).
Almost surely, 2123430515137 is an apocalyptic number.
It is an amenable number.
123430515137 is a deficient number, since it is larger than the sum of its proper divisors (1).
123430515137 is an equidigital number, since it uses as much as digits as its factorization.
123430515137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 37800, while the sum is 35.
Adding to 123430515137 its reverse (731515034321), we get a palindrome (854945549458).
The spelling of 123430515137 in words is "one hundred twenty-three billion, four hundred thirty million, five hundred fifteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •