Base | Representation |
---|---|
bin | 110001110011011011… |
… | …1110001111011110101 |
3 | 101020001201011212200002 |
4 | 1203212313301323311 |
5 | 3223014331102422 |
6 | 121044445201045 |
7 | 10504246035203 |
oct | 1434667617365 |
9 | 336051155602 |
10 | 106952597237 |
11 | 413a3a53332 |
12 | 1888a260185 |
13 | a1160594c5 |
14 | 526859c073 |
15 | 2bae7dd692 |
hex | 18e6df1ef5 |
106952597237 has 2 divisors, whose sum is σ = 106952597238. Its totient is φ = 106952597236.
The previous prime is 106952597231. The next prime is 106952597243. The reversal of 106952597237 is 732795259601.
It is a balanced prime because it is at equal distance from previous prime (106952597231) and next prime (106952597243).
It can be written as a sum of positive squares in only one way, i.e., 77556123121 + 29396474116 = 278489^2 + 171454^2 .
It is a cyclic number.
It is not a de Polignac number, because 106952597237 - 28 = 106952596981 is a prime.
It is a super-2 number, since 2×1069525972372 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106952597231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53476298618 + 53476298619.
It is an arithmetic number, because the mean of its divisors is an integer number (53476298619).
Almost surely, 2106952597237 is an apocalyptic number.
It is an amenable number.
106952597237 is a deficient number, since it is larger than the sum of its proper divisors (1).
106952597237 is an equidigital number, since it uses as much as digits as its factorization.
106952597237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7144200, while the sum is 56.
The spelling of 106952597237 in words is "one hundred six billion, nine hundred fifty-two million, five hundred ninety-seven thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •