Base | Representation |
---|---|
bin | 1000000000100001… |
… | …1001101100011111 |
3 | 12112211000100212202 |
4 | 2000020121230133 |
5 | 13400304423142 |
6 | 553151122115 |
7 | 104162013155 |
oct | 20010315437 |
9 | 5484010782 |
10 | 2149686047 |
11 | a03494a43 |
12 | 4bbb1333b |
13 | 2834963a2 |
14 | 1657013d5 |
15 | c8ace032 |
hex | 80219b1f |
2149686047 has 8 divisors (see below), whose sum is σ = 2248972992. Its totient is φ = 2052630400.
The previous prime is 2149686017. The next prime is 2149686059. The reversal of 2149686047 is 7406869412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2149686047 - 212 = 2149681951 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2149685992 and 2149686010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2149686017) 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 in 7 ways as a sum of consecutive naturals, for example, 555854 + ... + 559707.
It is an arithmetic number, because the mean of its divisors is an integer number (281121624).
Almost surely, 22149686047 is an apocalyptic number.
2149686047 is a deficient number, since it is larger than the sum of its proper divisors (99286945).
2149686047 is a wasteful number, since it uses less digits than its factorization.
2149686047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115649.
The product of its (nonzero) digits is 580608, while the sum is 47.
The square root of 2149686047 is about 46364.7069116154. The cubic root of 2149686047 is about 1290.6000547502.
The spelling of 2149686047 in words is "two billion, one hundred forty-nine million, six hundred eighty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •