Base | Representation |
---|---|
bin | 10111110111111101110011… |
… | …100110111001000000101001 |
3 | 111202202222221120122000000102 |
4 | 113313331303212321000221 |
5 | 102230314024243411022 |
6 | 1011152443521115145 |
7 | 31055033534602034 |
oct | 2767756346710051 |
9 | 452688846560012 |
10 | 105001005060137 |
11 | 30502748a9324a |
12 | b939a94188ab5 |
13 | 46787244c9644 |
14 | 1bd010bc6201b |
15 | c214b5371a92 |
hex | 5f7f739b9029 |
105001005060137 has 2 divisors, whose sum is σ = 105001005060138. Its totient is φ = 105001005060136.
The previous prime is 105001005060037. The next prime is 105001005060143. The reversal of 105001005060137 is 731060500100501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78282485412121 + 26718519648016 = 8847739^2 + 5168996^2 .
It is a cyclic number.
It is not a de Polignac number, because 105001005060137 - 218 = 105001004797993 is a prime.
It is a super-2 number, since 2×1050010050601372 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105001005060037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52500502530068 + 52500502530069.
It is an arithmetic number, because the mean of its divisors is an integer number (52500502530069).
Almost surely, 2105001005060137 is an apocalyptic number.
It is an amenable number.
105001005060137 is a deficient number, since it is larger than the sum of its proper divisors (1).
105001005060137 is an equidigital number, since it uses as much as digits as its factorization.
105001005060137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3150, while the sum is 29.
Adding to 105001005060137 its reverse (731060500100501), we get a palindrome (836061505160638).
The spelling of 105001005060137 in words is "one hundred five trillion, one billion, five million, sixty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •