Base | Representation |
---|---|
bin | 111011010110011010… |
… | …0001100010100000000 |
3 | 110011222110002022021010 |
4 | 1312230310030110000 |
5 | 4042011033232111 |
6 | 134315025000520 |
7 | 12131262102201 |
oct | 1665464142400 |
9 | 404873068233 |
10 | 127453414656 |
11 | 4a064147947 |
12 | 2084ba83140 |
13 | c0324142b9 |
14 | 62511ad5a8 |
15 | 34ae4d4aa6 |
hex | 1dacd0c500 |
127453414656 has 144 divisors (see below), whose sum is σ = 344163847104. Its totient is φ = 41868460032.
The previous prime is 127453414639. The next prime is 127453414681. The reversal of 127453414656 is 656414354721.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
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, 16184736 + ... + 16192608.
It is an arithmetic number, because the mean of its divisors is an integer number (2390026716).
Almost surely, 2127453414656 is an apocalyptic number.
127453414656 is a gapful number since it is divisible by the number (16) 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 127453414656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172081923552).
127453414656 is an abundant number, since it is smaller than the sum of its proper divisors (216710432448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
127453414656 is a wasteful number, since it uses less digits than its factorization.
127453414656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8196 (or 8182 counting only the distinct ones).
The product of its digits is 2419200, while the sum is 48.
The spelling of 127453414656 in words is "one hundred twenty-seven billion, four hundred fifty-three million, four hundred fourteen thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •