Base | Representation |
---|---|
bin | 1000000010110000… |
… | …0101010010100011 |
3 | 12120110121120121112 |
4 | 2000230011102203 |
5 | 13410203232101 |
6 | 554123413535 |
7 | 104334351146 |
oct | 20054052243 |
9 | 5513546545 |
10 | 2159039651 |
11 | a087a349a |
12 | 5030842ab |
13 | 2853bc972 |
14 | 166a5805d |
15 | c982a6bb |
hex | 80b054a3 |
2159039651 has 8 divisors (see below), whose sum is σ = 2232279600. Its totient is φ = 2086583328.
The previous prime is 2159039633. The next prime is 2159039681. The reversal of 2159039651 is 1569309512.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2159039651 - 26 = 2159039587 is a prime.
It is a super-2 number, since 2×21590396512 = 9322904429180403602, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2159039599 and 2159039608.
It is not an unprimeable number, because it can be changed into a prime (2159039621) 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 7 ways as a sum of consecutive naturals, for example, 190301 + ... + 201326.
It is an arithmetic number, because the mean of its divisors is an integer number (279034950).
Almost surely, 22159039651 is an apocalyptic number.
2159039651 is a deficient number, since it is larger than the sum of its proper divisors (73239949).
2159039651 is a wasteful number, since it uses less digits than its factorization.
2159039651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391813.
The product of its (nonzero) digits is 72900, while the sum is 41.
The square root of 2159039651 is about 46465.4672956164. The cubic root of 2159039651 is about 1292.4692106944.
The spelling of 2159039651 in words is "two billion, one hundred fifty-nine million, thirty-nine thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •