Base | Representation |
---|---|
bin | 100101000111011000101… |
… | …0010010101111100000101 |
3 | 200001122211110122111201121 |
4 | 1022032301102111330011 |
5 | 1132034023220243122 |
6 | 14503225132153541 |
7 | 1034354012210623 |
oct | 112166122257405 |
9 | 20048743574647 |
10 | 5101100556037 |
11 | 1697401307702 |
12 | 6a47643088b1 |
13 | 2b00548ba7a5 |
14 | 138c74a4c513 |
15 | 8ca583a1bc7 |
hex | 4a3b1495f05 |
5101100556037 has 2 divisors, whose sum is σ = 5101100556038. Its totient is φ = 5101100556036.
The previous prime is 5101100556011. The next prime is 5101100556073. The reversal of 5101100556037 is 7306550011015.
Together with next prime (5101100556073) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4389733138561 + 711367417476 = 2095169^2 + 843426^2 .
It is a cyclic number.
It is not a de Polignac number, because 5101100556037 - 219 = 5101100031749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5101100555993 and 5101100556011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5101100556337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2550550278018 + 2550550278019.
It is an arithmetic number, because the mean of its divisors is an integer number (2550550278019).
Almost surely, 25101100556037 is an apocalyptic number.
It is an amenable number.
5101100556037 is a deficient number, since it is larger than the sum of its proper divisors (1).
5101100556037 is an equidigital number, since it uses as much as digits as its factorization.
5101100556037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15750, while the sum is 34.
The spelling of 5101100556037 in words is "five trillion, one hundred one billion, one hundred million, five hundred fifty-six thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •