Base | Representation |
---|---|
bin | 111101111011001010100… |
… | …010011011100111011000 |
3 | 120001210222020021220200002 |
4 | 331323022202123213120 |
5 | 1024210042401143210 |
6 | 13014524433432132 |
7 | 616305111120212 |
oct | 75731242334730 |
9 | 16053866256602 |
10 | 4255415646680 |
11 | 13a0791215380 |
12 | 58888a10b648 |
13 | 24b38cb75593 |
14 | 109d6b0cb5b2 |
15 | 75a5e4804a5 |
hex | 3deca89b9d8 |
4255415646680 has 256 divisors, whose sum is σ = 10781641728000. Its totient is φ = 1498317004800.
The previous prime is 4255415646673. The next prime is 4255415646709. The reversal of 4255415646680 is 866465145524.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2274406145 + ... + 2274408015.
It is an arithmetic number, because the mean of its divisors is an integer number (42115788000).
Almost surely, 24255415646680 is an apocalyptic number.
4255415646680 is a gapful number since it is divisible by the number (40) 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 4255415646680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5390820864000).
4255415646680 is an abundant number, since it is smaller than the sum of its proper divisors (6526226081320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4255415646680 is a wasteful number, since it uses less digits than its factorization.
4255415646680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3058 (or 3054 counting only the distinct ones).
The product of its (nonzero) digits is 27648000, while the sum is 56.
The spelling of 4255415646680 in words is "four trillion, two hundred fifty-five billion, four hundred fifteen million, six hundred forty-six thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •