Base | Representation |
---|---|
bin | 1100110001000… |
… | …11101111100001 |
3 | 21110112022011101 |
4 | 12120203233201 |
5 | 204404214103 |
6 | 14343314401 |
7 | 2440226155 |
oct | 630435741 |
9 | 243468141 |
10 | 107101153 |
11 | 55501755 |
12 | 2ba4ba01 |
13 | 1925ba83 |
14 | 1031d065 |
15 | 9608a1d |
hex | 6623be1 |
107101153 has 2 divisors, whose sum is σ = 107101154. Its totient is φ = 107101152.
The previous prime is 107101103. The next prime is 107101171. The reversal of 107101153 is 351101701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88679889 + 18421264 = 9417^2 + 4292^2 .
It is an emirp because it is prime and its reverse (351101701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 107101153 - 213 = 107092961 is a prime.
It is a super-2 number, since 2×1071011532 = 22941313947858818, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 107101153.
It is not a weakly prime, because it can be changed into another prime (107101103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53550576 + 53550577.
It is an arithmetic number, because the mean of its divisors is an integer number (53550577).
Almost surely, 2107101153 is an apocalyptic number.
It is an amenable number.
107101153 is a deficient number, since it is larger than the sum of its proper divisors (1).
107101153 is an equidigital number, since it uses as much as digits as its factorization.
107101153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 105, while the sum is 19.
The square root of 107101153 is about 10348.9686925800. The cubic root of 107101153 is about 474.8954939065.
Adding to 107101153 its reverse (351101701), we get a palindrome (458202854).
The spelling of 107101153 in words is "one hundred seven million, one hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •