Base | Representation |
---|---|
bin | 1000000010000101… |
… | …0001101111000000 |
3 | 12120021021200000000 |
4 | 2000201101233000 |
5 | 13403442111130 |
6 | 553543000000 |
7 | 104301312621 |
oct | 20041215700 |
9 | 5507250000 |
10 | 2156207040 |
11 | a07139299 |
12 | 502139000 |
13 | 28493a570 |
14 | 16651ba48 |
15 | c946b260 |
hex | 80851bc0 |
2156207040 has 504 divisors, whose sum is σ = 8398703040. Its totient is φ = 524040192.
The previous prime is 2156207033. The next prime is 2156207051. The reversal of 2156207040 is 407026512.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2156206995 and 2156207013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 27293721 + ... + 27293799.
Almost surely, 22156207040 is an apocalyptic number.
2156207040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2156207040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4199351520).
2156207040 is an abundant number, since it is smaller than the sum of its proper divisors (6242496000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2156207040 is an frugal number, since it uses more digits than its factorization.
2156207040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 2156207040 is about 46434.9764724825. The cubic root of 2156207040 is about 1291.9037332383.
The spelling of 2156207040 in words is "two billion, one hundred fifty-six million, two hundred seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.180 sec. • engine limits •