Base | Representation |
---|---|
bin | 1100110011110… |
… | …10010011000001 |
3 | 21111012022111001 |
4 | 12121322103001 |
5 | 210002040211 |
6 | 14355052001 |
7 | 2443233604 |
oct | 631722301 |
9 | 244168431 |
10 | 107455681 |
11 | 55724053 |
12 | 2bba1001 |
13 | 19354258 |
14 | 103b233b |
15 | 9678ac1 |
hex | 667a4c1 |
107455681 has 2 divisors, whose sum is σ = 107455682. Its totient is φ = 107455680.
The previous prime is 107455637. The next prime is 107455693. The reversal of 107455681 is 186554701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83101456 + 24354225 = 9116^2 + 4935^2 .
It is a cyclic number.
It is not a de Polignac number, because 107455681 - 29 = 107455169 is a prime.
It is a super-2 number, since 2×1074556812 = 23093446758347522, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 107455681.
It is not a weakly prime, because it can be changed into another prime (107456681) 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, 53727840 + 53727841.
It is an arithmetic number, because the mean of its divisors is an integer number (53727841).
Almost surely, 2107455681 is an apocalyptic number.
It is an amenable number.
107455681 is a deficient number, since it is larger than the sum of its proper divisors (1).
107455681 is an equidigital number, since it uses as much as digits as its factorization.
107455681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33600, while the sum is 37.
The square root of 107455681 is about 10366.0832043738. The cubic root of 107455681 is about 475.4189190747.
The spelling of 107455681 in words is "one hundred seven million, four hundred fifty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •