Base | Representation |
---|---|
bin | 101111101110011… |
… | …1011101101111101 |
3 | 11010121100120110200 |
4 | 1133130323231331 |
5 | 11234430421112 |
6 | 422523554113 |
7 | 54453563301 |
oct | 13734735575 |
9 | 4117316420 |
10 | 1601420157 |
11 | 751a61737 |
12 | 38838b939 |
13 | 1c6a122bc |
14 | 112983d01 |
15 | 958cecdc |
hex | 5f73bb7d |
1601420157 has 12 divisors (see below), whose sum is σ = 2319270720. Its totient is φ = 1064794248.
The previous prime is 1601420137. The next prime is 1601420173. The reversal of 1601420157 is 7510241061.
It is a happy number.
1601420157 is a `hidden beast` number, since 1 + 601 + 4 + 2 + 0 + 1 + 57 = 666.
It is not a de Polignac number, because 1601420157 - 28 = 1601419901 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1601420157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1601420137) 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 in 11 ways as a sum of consecutive naturals, for example, 231333 + ... + 238154.
It is an arithmetic number, because the mean of its divisors is an integer number (193272560).
Almost surely, 21601420157 is an apocalyptic number.
It is an amenable number.
1601420157 is a deficient number, since it is larger than the sum of its proper divisors (717850563).
1601420157 is a wasteful number, since it uses less digits than its factorization.
1601420157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469872 (or 469869 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The square root of 1601420157 is about 40017.7480250951. The cubic root of 1601420157 is about 1169.9530399736.
The spelling of 1601420157 in words is "one billion, six hundred one million, four hundred twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •