Base | Representation |
---|---|
bin | 111011110110101110… |
… | …0001111010100001100 |
3 | 110021210000021101202212 |
4 | 1313231130033110030 |
5 | 4101221114421130 |
6 | 135014400005552 |
7 | 12200166015341 |
oct | 1675534172414 |
9 | 407700241685 |
10 | 128537654540 |
11 | 4a570178369 |
12 | 20ab30008b8 |
13 | c175c37669 |
14 | 63151a87c8 |
15 | 35247a5e95 |
hex | 1ded70f50c |
128537654540 has 48 divisors (see below), whose sum is σ = 276421851552. Its totient is φ = 50180207616.
The previous prime is 128537654491. The next prime is 128537654561. The reversal of 128537654540 is 45456735821.
It is a super-2 number, since 2×1285376545402 (a number of 23 digits) contains 22 as substring.
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, 1057802 + ... + 1173038.
It is an arithmetic number, because the mean of its divisors is an integer number (5758788574).
Almost surely, 2128537654540 is an apocalyptic number.
128537654540 is a gapful number since it is divisible by the number (10) 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 128537654540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (138210925776).
128537654540 is an abundant number, since it is smaller than the sum of its proper divisors (147884197012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128537654540 is a wasteful number, since it uses less digits than its factorization.
128537654540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116586 (or 116584 counting only the distinct ones).
The product of its (nonzero) digits is 4032000, while the sum is 50.
The spelling of 128537654540 in words is "one hundred twenty-eight billion, five hundred thirty-seven million, six hundred fifty-four thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •