Base | Representation |
---|---|
bin | 1100110010000… |
… | …11000100010101 |
3 | 21110202211011112 |
4 | 12121003010111 |
5 | 204422320321 |
6 | 14350144405 |
7 | 2441302223 |
oct | 631030425 |
9 | 243684145 |
10 | 107229461 |
11 | 5558a099 |
12 | 2bab2105 |
13 | 192a52b1 |
14 | 10353b13 |
15 | 9631a5b |
hex | 6643115 |
107229461 has 2 divisors, whose sum is σ = 107229462. Its totient is φ = 107229460.
The previous prime is 107229439. The next prime is 107229467. The reversal of 107229461 is 164922701.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100500625 + 6728836 = 10025^2 + 2594^2 .
It is an emirp because it is prime and its reverse (164922701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 107229461 - 214 = 107213077 is a prime.
It is a super-2 number, since 2×1072294612 = 22996314612701042, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107229467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53614730 + 53614731.
It is an arithmetic number, because the mean of its divisors is an integer number (53614731).
Almost surely, 2107229461 is an apocalyptic number.
It is an amenable number.
107229461 is a deficient number, since it is larger than the sum of its proper divisors (1).
107229461 is an equidigital number, since it uses as much as digits as its factorization.
107229461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 32.
The square root of 107229461 is about 10355.1659088592. The cubic root of 107229461 is about 475.0850610363.
The spelling of 107229461 in words is "one hundred seven million, two hundred twenty-nine thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •