Base | Representation |
---|---|
bin | 111001011011000000… |
… | …1111000001110010101 |
3 | 102210021220012222022122 |
4 | 1302312001320032111 |
5 | 4010021113430122 |
6 | 132352122105325 |
7 | 11623545314051 |
oct | 1626601701625 |
9 | 383256188278 |
10 | 123313030037 |
11 | 48329a9967a |
12 | 1ba9534b245 |
13 | b8226ac482 |
14 | 5d7b354c61 |
15 | 331ac7e142 |
hex | 1cb6078395 |
123313030037 has 2 divisors, whose sum is σ = 123313030038. Its totient is φ = 123313030036.
The previous prime is 123313030003. The next prime is 123313030069. The reversal of 123313030037 is 730030313321.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121247418436 + 2065611601 = 348206^2 + 45449^2 .
It is a cyclic number.
It is not a de Polignac number, because 123313030037 - 216 = 123312964501 is a prime.
It is a super-2 number, since 2×1233130300372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123313029988 and 123313030015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123313030097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61656515018 + 61656515019.
It is an arithmetic number, because the mean of its divisors is an integer number (61656515019).
Almost surely, 2123313030037 is an apocalyptic number.
It is an amenable number.
123313030037 is a deficient number, since it is larger than the sum of its proper divisors (1).
123313030037 is an equidigital number, since it uses as much as digits as its factorization.
123313030037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3402, while the sum is 26.
Adding to 123313030037 its reverse (730030313321), we get a palindrome (853343343358).
The spelling of 123313030037 in words is "one hundred twenty-three billion, three hundred thirteen million, thirty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •