Base | Representation |
---|---|
bin | 110001100100110100… |
… | …1000100000011100101 |
3 | 101011210112102010011211 |
4 | 1203021221010003211 |
5 | 3221013310400122 |
6 | 120524050231421 |
7 | 10456142524564 |
oct | 1431151040345 |
9 | 334715363154 |
10 | 106462200037 |
11 | 41172155696 |
12 | 18771b85571 |
13 | a06858724b |
14 | 521d3c5bdb |
15 | 2b81720877 |
hex | 18c9a440e5 |
106462200037 has 2 divisors, whose sum is σ = 106462200038. Its totient is φ = 106462200036.
The previous prime is 106462199999. The next prime is 106462200043. The reversal of 106462200037 is 730002264601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87813839556 + 18648360481 = 296334^2 + 136559^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106462200037 is a prime.
It is a super-2 number, since 2×1064622000372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106462199981 and 106462200008.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106462200067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53231100018 + 53231100019.
It is an arithmetic number, because the mean of its divisors is an integer number (53231100019).
Almost surely, 2106462200037 is an apocalyptic number.
It is an amenable number.
106462200037 is a deficient number, since it is larger than the sum of its proper divisors (1).
106462200037 is an equidigital number, since it uses as much as digits as its factorization.
106462200037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 31.
Adding to 106462200037 its reverse (730002264601), we get a palindrome (836464464638).
The spelling of 106462200037 in words is "one hundred six billion, four hundred sixty-two million, two hundred thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •