Base | Representation |
---|---|
bin | 10111010011010100… |
… | …01101001100110101 |
3 | 1012021211221102100001 |
4 | 23221222031030311 |
5 | 201110040340122 |
6 | 5425210351301 |
7 | 622004003464 |
oct | 135152151465 |
9 | 35254842301 |
10 | 12510090037 |
11 | 533a68a895 |
12 | 251172b531 |
13 | 1244a40453 |
14 | 86967c9db |
15 | 4d342d527 |
hex | 2e9a8d335 |
12510090037 has 2 divisors, whose sum is σ = 12510090038. Its totient is φ = 12510090036.
The previous prime is 12510090031. The next prime is 12510090041. The reversal of 12510090037 is 73009001521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12204504676 + 305585361 = 110474^2 + 17481^2 .
It is an emirp because it is prime and its reverse (73009001521) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12510090037 is a prime.
It is a super-2 number, since 2×125100900372 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12510089987 and 12510090014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12510090031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6255045018 + 6255045019.
It is an arithmetic number, because the mean of its divisors is an integer number (6255045019).
Almost surely, 212510090037 is an apocalyptic number.
It is an amenable number.
12510090037 is a deficient number, since it is larger than the sum of its proper divisors (1).
12510090037 is an equidigital number, since it uses as much as digits as its factorization.
12510090037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1890, while the sum is 28.
Adding to 12510090037 its reverse (73009001521), we get a palindrome (85519091558).
The spelling of 12510090037 in words is "twelve billion, five hundred ten million, ninety thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •