Base | Representation |
---|---|
bin | 111111110001010… |
… | …1010001100010110 |
3 | 12112010101201000010 |
4 | 1333202222030112 |
5 | 13340241322100 |
6 | 552155101050 |
7 | 104011635036 |
oct | 17742521426 |
9 | 5463351003 |
10 | 2139792150 |
11 | 9a8947571 |
12 | 4b8741786 |
13 | 281410c02 |
14 | 1642878c6 |
15 | c7cc7750 |
hex | 7f8aa316 |
2139792150 has 24 divisors (see below), whose sum is σ = 5306684904. Its totient is φ = 570611200.
The previous prime is 2139792113. The next prime is 2139792157. The reversal of 2139792150 is 512979312.
It is a hoax number, since the sum of its digits (39) 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 = 2139792099 and 2139792108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2139792157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7132491 + ... + 7132790.
It is an arithmetic number, because the mean of its divisors is an integer number (221111871).
Almost surely, 22139792150 is an apocalyptic number.
2139792150 is an abundant number, since it is smaller than the sum of its proper divisors (3166892754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2139792150 is a wasteful number, since it uses less digits than its factorization.
2139792150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14265296 (or 14265291 counting only the distinct ones).
The product of its (nonzero) digits is 34020, while the sum is 39.
The square root of 2139792150 is about 46257.8874355498. The cubic root of 2139792150 is about 1288.6170203627.
The spelling of 2139792150 in words is "two billion, one hundred thirty-nine million, seven hundred ninety-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •