Base | Representation |
---|---|
bin | 1000000000101000… |
… | …1100100100111001 |
3 | 12112211220021100200 |
4 | 2000022030210321 |
5 | 13400420002401 |
6 | 553205152413 |
7 | 104166013065 |
oct | 20012144471 |
9 | 5484807320 |
10 | 2150156601 |
11 | a0378652a |
12 | 5000bb709 |
13 | 2835cc618 |
14 | 1657c4aa5 |
15 | c8b73686 |
hex | 8028c939 |
2150156601 has 12 divisors (see below), whose sum is σ = 3106531428. Its totient is φ = 1433091744.
The previous prime is 2150156581. The next prime is 2150156653. The reversal of 2150156601 is 1066510512.
It is a happy number.
2150156601 is a `hidden beast` number, since 2 + 1 + 5 + 0 + 1 + 56 + 601 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1861836201 + 288320400 = 43149^2 + 16980^2 .
It is not a de Polignac number, because 2150156601 - 26 = 2150156537 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2150156681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13851 + ... + 67023.
It is an arithmetic number, because the mean of its divisors is an integer number (258877619).
Almost surely, 22150156601 is an apocalyptic number.
It is an amenable number.
2150156601 is a deficient number, since it is larger than the sum of its proper divisors (956374827).
2150156601 is a wasteful number, since it uses less digits than its factorization.
2150156601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57672 (or 57669 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The square root of 2150156601 is about 46369.7811187415. The cubic root of 2150156601 is about 1290.6942162075.
The spelling of 2150156601 in words is "two billion, one hundred fifty million, one hundred fifty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •