Base | Representation |
---|---|
bin | 111011010001000011111001… |
… | …1000110101101101100101000 |
3 | 2112100211011101120201210101110 |
4 | 1312202013303012231230220 |
5 | 1021312203213433010440 |
6 | 5044424254434550320 |
7 | 214543500634544202 |
oct | 16642076306555450 |
9 | 2470734346653343 |
10 | 521314324110120 |
11 | 14111a188361a32 |
12 | 4a5762604383a0 |
13 | 194b6964570958 |
14 | 92a3a683c7772 |
15 | 40408adeb0080 |
hex | 1da21f31adb28 |
521314324110120 has 32 divisors (see below), whose sum is σ = 1563942972330720. Its totient is φ = 139017153096000.
The previous prime is 521314324110103. The next prime is 521314324110127. The reversal of 521314324110120 is 21011423413125.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (521314324110127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2172143017006 + ... + 2172143017245.
It is an arithmetic number, because the mean of its divisors is an integer number (48873217885335).
Almost surely, 2521314324110120 is an apocalyptic number.
It is an amenable number.
521314324110120 is an abundant number, since it is smaller than the sum of its proper divisors (1042628648220600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
521314324110120 is a wasteful number, since it uses less digits than its factorization.
521314324110120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4344286034265 (or 4344286034261 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 521314324110120 its reverse (21011423413125), we get a palindrome (542325747523245).
The spelling of 521314324110120 in words is "five hundred twenty-one trillion, three hundred fourteen billion, three hundred twenty-four million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.081 sec. • engine limits •