Base | Representation |
---|---|
bin | 11110111110110000010… |
… | …010101011001011101000 |
3 | 21112112020100001201000000 |
4 | 132332300102223023220 |
5 | 234340110410401000 |
6 | 4310011140343000 |
7 | 306545526433110 |
oct | 36766022531350 |
9 | 7475210051000 |
10 | 2128966497000 |
11 | 7509870a3902 |
12 | 2a47366a4a60 |
13 | 1259b729b465 |
14 | 750849aa040 |
15 | 3a5a5243000 |
hex | 1efb04ab2e8 |
2128966497000 has 896 divisors, whose sum is σ = 8645983257600. Its totient is φ = 480370176000.
The previous prime is 2128966496989. The next prime is 2128966497059. The reversal of 2128966497000 is 7946698212.
2128966497000 is a `hidden beast` number, since 2 + 12 + 89 + 66 + 497 + 0 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 223 ways as a sum of consecutive naturals, for example, 403134360 + ... + 403139640.
Almost surely, 22128966497000 is an apocalyptic number.
2128966497000 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 2128966497000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4322991628800).
2128966497000 is an abundant number, since it is smaller than the sum of its proper divisors (6517016760600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2128966497000 is an equidigital number, since it uses as much as digits as its factorization.
2128966497000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5406 (or 5377 counting only the distinct ones).
The product of its (nonzero) digits is 2612736, while the sum is 54.
The spelling of 2128966497000 in words is "two trillion, one hundred twenty-eight billion, nine hundred sixty-six million, four hundred ninety-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •