Base | Representation |
---|---|
bin | 1100110000011… |
… | …11111101111001 |
3 | 21110101012001101 |
4 | 12120033331321 |
5 | 204344121103 |
6 | 14341451401 |
7 | 2436441052 |
oct | 630177571 |
9 | 243335041 |
10 | 107020153 |
11 | 55456909 |
12 | 2ba10b61 |
13 | 19230c46 |
14 | 102db729 |
15 | 95dea1d |
hex | 660ff79 |
107020153 has 16 divisors (see below), whose sum is σ = 112766976. Its totient is φ = 101445120.
The previous prime is 107020139. The next prime is 107020157. The reversal of 107020153 is 351020701.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107020153 is a prime.
It is a super-2 number, since 2×1070201532 = 22906626296286818, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 107020153.
It is not an unprimeable number, because it can be changed into a prime (107020157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 479800 + ... + 480022.
It is an arithmetic number, because the mean of its divisors is an integer number (7047936).
Almost surely, 2107020153 is an apocalyptic number.
It is an amenable number.
107020153 is a deficient number, since it is larger than the sum of its proper divisors (5746823).
107020153 is a wasteful number, since it uses less digits than its factorization.
107020153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504.
The product of its (nonzero) digits is 210, while the sum is 19.
The square root of 107020153 is about 10345.0545189477. The cubic root of 107020153 is about 474.7757434483.
Adding to 107020153 its reverse (351020701), we get a palindrome (458040854).
The spelling of 107020153 in words is "one hundred seven million, twenty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •