Base | Representation |
---|---|
bin | 1000000010111010… |
… | …0111101001001000 |
3 | 12120111212100211001 |
4 | 2000232213221020 |
5 | 13410341022043 |
6 | 554145544344 |
7 | 104343121003 |
oct | 20056475110 |
9 | 5514770731 |
10 | 2159704648 |
11 | a09108082 |
12 | 5033450b4 |
13 | 28559355a |
14 | 166b8c53a |
15 | c990c74d |
hex | 80ba7a48 |
2159704648 has 8 divisors (see below), whose sum is σ = 4049446230. Its totient is φ = 1079852320.
The previous prime is 2159704639. The next prime is 2159704649. The reversal of 2159704648 is 8464079512.
It can be written as a sum of positive squares in only one way, i.e., 1200068164 + 959636484 = 34642^2 + 30978^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a hoax number, since the sum of its digits (46) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 2159704598 and 2159704607.
It is not an unprimeable number, because it can be changed into a prime (2159704649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 134981533 + ... + 134981548.
Almost surely, 22159704648 is an apocalyptic number.
It is an amenable number.
2159704648 is a deficient number, since it is larger than the sum of its proper divisors (1889741582).
2159704648 is a wasteful number, since it uses less digits than its factorization.
2159704648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269963087 (or 269963083 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 46.
The square root of 2159704648 is about 46472.6225642582. The cubic root of 2159704648 is about 1292.6018931303.
The spelling of 2159704648 in words is "two billion, one hundred fifty-nine million, seven hundred four thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •