Base | Representation |
---|---|
bin | 111100000010111101… |
… | …0001101110111101000 |
3 | 110022211121201112210110 |
4 | 1320011322031313220 |
5 | 4103041212303440 |
6 | 135123222414320 |
7 | 12213312220164 |
oct | 1700572156750 |
9 | 408747645713 |
10 | 128948166120 |
11 | 4a760972834 |
12 | 20ba85913a0 |
13 | c20ccb9617 |
14 | 6353907ca4 |
15 | 354a844080 |
hex | 1e05e8dde8 |
128948166120 has 64 divisors (see below), whose sum is σ = 387031141440. Its totient is φ = 34369587200.
The previous prime is 128948166103. The next prime is 128948166173. The reversal of 128948166120 is 21661849821.
It is a super-2 number, since 2×1289481661202 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 128948166120.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8466 + ... + 507905.
It is an arithmetic number, because the mean of its divisors is an integer number (6047361585).
Almost surely, 2128948166120 is an apocalyptic number.
128948166120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
128948166120 is an abundant number, since it is smaller than the sum of its proper divisors (258082975320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128948166120 is a wasteful number, since it uses less digits than its factorization.
128948166120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 518466 (or 518462 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 48.
The spelling of 128948166120 in words is "one hundred twenty-eight billion, nine hundred forty-eight million, one hundred sixty-six thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •