Base | Representation |
---|---|
bin | 110001011101010101… |
… | …001011010111010100 |
3 | 12002002000020212202000 |
4 | 301131111023113110 |
5 | 1332224443041322 |
6 | 40221333515300 |
7 | 3560000536206 |
oct | 613525132724 |
9 | 162060225660 |
10 | 53105440212 |
11 | 20581700270 |
12 | a360aa2b30 |
13 | 5014251006 |
14 | 27dad42776 |
15 | 15ac3153ac |
hex | c5d54b5d4 |
53105440212 has 48 divisors (see below), whose sum is σ = 150197208000. Its totient is φ = 16092557280.
The previous prime is 53105440187. The next prime is 53105440231. The reversal of 53105440212 is 21204450135.
53105440212 is a `hidden beast` number, since 5 + 3 + 1 + 0 + 5 + 440 + 212 = 666.
It is a super-2 number, since 2×531054402122 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22349587 + ... + 22351962.
It is an arithmetic number, because the mean of its divisors is an integer number (3129108500).
Almost surely, 253105440212 is an apocalyptic number.
It is an amenable number.
53105440212 is an abundant number, since it is smaller than the sum of its proper divisors (97091767788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53105440212 is a wasteful number, since it uses less digits than its factorization.
53105440212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44701573 (or 44701565 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 53105440212 its reverse (21204450135), we get a palindrome (74309890347).
The spelling of 53105440212 in words is "fifty-three billion, one hundred five million, four hundred forty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •