Base | Representation |
---|---|
bin | 1111011111111100… |
… | …1010011011100111 |
3 | 101201221202211102022 |
4 | 3313333022123213 |
5 | 32010043431101 |
6 | 1524502333355 |
7 | 205046631341 |
oct | 36777123347 |
9 | 11657684368 |
10 | 4160530151 |
11 | 1845568978 |
12 | 98142a25b |
13 | 513c6957b |
14 | 2b67c0291 |
15 | 1953d4a1b |
hex | f7fca6e7 |
4160530151 has 2 divisors, whose sum is σ = 4160530152. Its totient is φ = 4160530150.
The previous prime is 4160530133. The next prime is 4160530159. The reversal of 4160530151 is 1510350614.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4160530151 - 222 = 4156335847 is a prime.
It is a super-2 number, since 2×41605301512 = 34620022274760165602, 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 4160530151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4160530159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2080265075 + 2080265076.
It is an arithmetic number, because the mean of its divisors is an integer number (2080265076).
Almost surely, 24160530151 is an apocalyptic number.
4160530151 is a deficient number, since it is larger than the sum of its proper divisors (1).
4160530151 is an equidigital number, since it uses as much as digits as its factorization.
4160530151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 4160530151 is about 64502.1716766188. The cubic root of 4160530151 is about 1608.3586207830.
Adding to 4160530151 its reverse (1510350614), we get a palindrome (5670880765).
The spelling of 4160530151 in words is "four billion, one hundred sixty million, five hundred thirty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •