Base | Representation |
---|---|
bin | 100101111011000100101… |
… | …1110000110100111011100 |
3 | 200110021100022212212111221 |
4 | 1023312021132012213130 |
5 | 1140343341013400220 |
6 | 15030223444023124 |
7 | 1045363511315413 |
oct | 113661136064734 |
9 | 20407308785457 |
10 | 5212101700060 |
11 | 172a492592072 |
12 | 702182391aa4 |
13 | 2ba6646354b8 |
14 | 1403a4b9a47a |
15 | 908a33049aa |
hex | 4bd897869dc |
5212101700060 has 24 divisors (see below), whose sum is σ = 10962175333536. Its totient is φ = 2081647963200.
The previous prime is 5212101700037. The next prime is 5212101700061. The reversal of 5212101700060 is 600071012125.
It is a junction number, because it is equal to n+sod(n) for n = 5212101699998 and 5212101700034.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5212101700061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 199531416 + ... + 199557535.
It is an arithmetic number, because the mean of its divisors is an integer number (456757305564).
Almost surely, 25212101700060 is an apocalyptic number.
It is an amenable number.
5212101700060 is an abundant number, since it is smaller than the sum of its proper divisors (5750073633476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5212101700060 is a wasteful number, since it uses less digits than its factorization.
5212101700060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399089613 (or 399089611 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 25.
Adding to 5212101700060 its reverse (600071012125), we get a palindrome (5812172712185).
The spelling of 5212101700060 in words is "five trillion, two hundred twelve billion, one hundred one million, seven hundred thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •