Base | Representation |
---|---|
bin | 1100100010100001010… |
… | …1101111011000110000 |
3 | 202121001100102121212002 |
4 | 3020220111233120300 |
5 | 12012142314340220 |
6 | 242544232353132 |
7 | 21364302404162 |
oct | 3105025573060 |
9 | 677040377762 |
10 | 215425152560 |
11 | 833a7978672 |
12 | 359015457a8 |
13 | 17411c75297 |
14 | a5d8976932 |
15 | 590c769c75 |
hex | 322856f630 |
215425152560 has 40 divisors (see below), whose sum is σ = 510313744080. Its totient is φ = 84544209152.
The previous prime is 215425152493. The next prime is 215425152571. The reversal of 215425152560 is 65251524512.
215425152560 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (40).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25399670 + ... + 25408149.
It is an arithmetic number, because the mean of its divisors is an integer number (12757843602).
Almost surely, 2215425152560 is an apocalyptic number.
215425152560 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
215425152560 is an abundant number, since it is smaller than the sum of its proper divisors (294888591520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215425152560 is a wasteful number, since it uses less digits than its factorization.
215425152560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50807885 (or 50807879 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 38.
The spelling of 215425152560 in words is "two hundred fifteen billion, four hundred twenty-five million, one hundred fifty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •