Base | Representation |
---|---|
bin | 1100101010001… |
… | …11110100010001 |
3 | 21101211112110211 |
4 | 12111013310101 |
5 | 204141402322 |
6 | 14312124121 |
7 | 2426454655 |
oct | 625076421 |
9 | 241745424 |
10 | 106200337 |
11 | 54a46981 |
12 | 2b696641 |
13 | 19004a49 |
14 | 10166a65 |
15 | 94cbb77 |
hex | 6547d11 |
106200337 has 2 divisors, whose sum is σ = 106200338. Its totient is φ = 106200336.
The previous prime is 106200317. The next prime is 106200383. The reversal of 106200337 is 733002601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106007616 + 192721 = 10296^2 + 439^2 .
It is an emirp because it is prime and its reverse (733002601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106200337 - 219 = 105676049 is a prime.
It is a super-2 number, since 2×1062003372 = 22557023157827138, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106200317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53100168 + 53100169.
It is an arithmetic number, because the mean of its divisors is an integer number (53100169).
Almost surely, 2106200337 is an apocalyptic number.
It is an amenable number.
106200337 is a deficient number, since it is larger than the sum of its proper divisors (1).
106200337 is an equidigital number, since it uses as much as digits as its factorization.
106200337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 22.
The square root of 106200337 is about 10305.3547731264. The cubic root of 106200337 is about 473.5603122963.
Adding to 106200337 its reverse (733002601), we get a palindrome (839202938).
The spelling of 106200337 in words is "one hundred six million, two hundred thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •