Base | Representation |
---|---|
bin | 111101000111100… |
… | …1010000110000000 |
3 | 12021220221010022000 |
4 | 1322033022012000 |
5 | 13200000400411 |
6 | 535255344000 |
7 | 101551313556 |
oct | 17217120600 |
9 | 5256833260 |
10 | 2050793856 |
11 | 96268a861 |
12 | 492982000 |
13 | 268b4cbb7 |
14 | 15651bbd6 |
15 | c0097956 |
hex | 7a3ca180 |
2050793856 has 64 divisors (see below), whose sum is σ = 6052700400. Its totient is φ = 683596800.
The previous prime is 2050793851. The next prime is 2050793863. The reversal of 2050793856 is 6583970502.
It is a happy number.
2050793856 is a `hidden beast` number, since 2 + 0 + 507 + 93 + 8 + 56 = 666.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2050793851) 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, 293245 + ... + 300156.
Almost surely, 22050793856 is an apocalyptic number.
It is an amenable number.
2050793856 is an abundant number, since it is smaller than the sum of its proper divisors (4001906544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2050793856 is an equidigital number, since it uses as much as digits as its factorization.
2050793856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593424 (or 593406 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 45.
The square root of 2050793856 is about 45285.6915150912. The cubic root of 2050793856 is about 1270.4980492269.
The spelling of 2050793856 in words is "two billion, fifty million, seven hundred ninety-three thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •