Base | Representation |
---|---|
bin | 1001101111010000000010… |
… | …10010100110001010001000 |
3 | 2210211020011020220012020110 |
4 | 10313220001102212022020 |
5 | 10301324331004334320 |
6 | 113313442425354320 |
7 | 4340106636435306 |
oct | 467500122461210 |
9 | 83736136805213 |
10 | 21414728589960 |
11 | 6906a3200aa22 |
12 | 249a3993389a0 |
13 | bc45284390a4 |
14 | 54069a9db276 |
15 | 2720a60975e0 |
hex | 137a014a6288 |
21414728589960 has 64 divisors (see below), whose sum is σ = 64244596363200. Its totient is φ = 5710557793536.
The previous prime is 21414728589871. The next prime is 21414728589997. The reversal of 21414728589960 is 6998582741412.
It is a junction number, because it is equal to n+sod(n) for n = 21414728589891 and 21414728589900.
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 15 ways as a sum of consecutive naturals, for example, 21986007 + ... + 22939353.
It is an arithmetic number, because the mean of its divisors is an integer number (1003821818175).
Almost surely, 221414728589960 is an apocalyptic number.
21414728589960 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21414728589960 is an abundant number, since it is smaller than the sum of its proper divisors (42829867773240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21414728589960 is a wasteful number, since it uses less digits than its factorization.
21414728589960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1140550 (or 1140546 counting only the distinct ones).
The product of its (nonzero) digits is 69672960, while the sum is 66.
The spelling of 21414728589960 in words is "twenty-one trillion, four hundred fourteen billion, seven hundred twenty-eight million, five hundred eighty-nine thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •