Base | Representation |
---|---|
bin | 11111111101101010011… |
… | …100000001110001101000 |
3 | 21202222120211122102112000 |
4 | 133331222130001301220 |
5 | 241441430042123311 |
6 | 4401021542251000 |
7 | 314456444055300 |
oct | 37755234016150 |
9 | 7688524572460 |
10 | 2196514020456 |
11 | 7775999a0a58 |
12 | 2b5848126a60 |
13 | 12c1905b5752 |
14 | 784519c2600 |
15 | 3c20a3b4056 |
hex | 1ff6a701c68 |
2196514020456 has 192 divisors, whose sum is σ = 7106252472000. Its totient is φ = 626808551040.
The previous prime is 2196514020443. The next prime is 2196514020457. The reversal of 2196514020456 is 6540204156912.
2196514020456 is a `hidden beast` number, since 2 + 1 + 96 + 51 + 40 + 20 + 456 = 666.
It is not an unprimeable number, because it can be changed into a prime (2196514020457) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8563075 + ... + 8815853.
It is an arithmetic number, because the mean of its divisors is an integer number (37011731625).
Almost surely, 22196514020456 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2196514020456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3553126236000).
2196514020456 is an abundant number, since it is smaller than the sum of its proper divisors (4909738451544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2196514020456 is a wasteful number, since it uses less digits than its factorization.
2196514020456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 253629 (or 253612 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 45.
The spelling of 2196514020456 in words is "two trillion, one hundred ninety-six billion, five hundred fourteen million, twenty thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •