Base | Representation |
---|---|
bin | 110001100001110110… |
… | …0001010101111001001 |
3 | 101011112120112020102012 |
4 | 1203003230022233021 |
5 | 3220312230204122 |
6 | 120510122145305 |
7 | 10453521030302 |
oct | 1430354125711 |
9 | 334476466365 |
10 | 106362350537 |
11 | 41120857243 |
12 | 18744652235 |
13 | a0509970c1 |
14 | 52100337a9 |
15 | 2b77a9a7e2 |
hex | 18c3b0abc9 |
106362350537 has 2 divisors, whose sum is σ = 106362350538. Its totient is φ = 106362350536.
The previous prime is 106362350527. The next prime is 106362350561. The reversal of 106362350537 is 735053263601.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70403192896 + 35959157641 = 265336^2 + 189629^2 .
It is an emirp because it is prime and its reverse (735053263601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106362350537 - 26 = 106362350473 is a prime.
It is a super-2 number, since 2×1063623505372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106362350494 and 106362350503.
It is not a weakly prime, because it can be changed into another prime (106362350527) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53181175268 + 53181175269.
It is an arithmetic number, because the mean of its divisors is an integer number (53181175269).
Almost surely, 2106362350537 is an apocalyptic number.
It is an amenable number.
106362350537 is a deficient number, since it is larger than the sum of its proper divisors (1).
106362350537 is an equidigital number, since it uses as much as digits as its factorization.
106362350537 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 340200, while the sum is 41.
The spelling of 106362350537 in words is "one hundred six billion, three hundred sixty-two million, three hundred fifty thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.301 sec. • engine limits •