Base | Representation |
---|---|
bin | 111101111011110… |
… | …0110001101011000 |
3 | 12100211110002001001 |
4 | 1323313212031120 |
5 | 13224003000432 |
6 | 542114234344 |
7 | 102333112321 |
oct | 17367461530 |
9 | 5324402031 |
10 | 2078171992 |
11 | 97708a416 |
12 | 49bb859b4 |
13 | 271717690 |
14 | 15a007448 |
15 | c26a49e7 |
hex | 7bde6358 |
2078171992 has 32 divisors (see below), whose sum is σ = 4378762080. Its totient is φ = 917452800.
The previous prime is 2078171989. The next prime is 2078171999. The reversal of 2078171992 is 2991718702.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2078171999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 432009 + ... + 436792.
It is an arithmetic number, because the mean of its divisors is an integer number (136836315).
Almost surely, 22078171992 is an apocalyptic number.
It is an amenable number.
2078171992 is an abundant number, since it is smaller than the sum of its proper divisors (2300590088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2078171992 is a wasteful number, since it uses less digits than its factorization.
2078171992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 868843 (or 868839 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 46.
The square root of 2078171992 is about 45586.9717353544. The cubic root of 2078171992 is about 1276.1267992427.
The spelling of 2078171992 in words is "two billion, seventy-eight million, one hundred seventy-one thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •