Base | Representation |
---|---|
bin | 110001101001100110… |
… | …001011100011011000 |
3 | 12002121100110210001200 |
4 | 301221212023203120 |
5 | 1333140133132044 |
6 | 40254004314200 |
7 | 3565046633052 |
oct | 615146134330 |
9 | 162540423050 |
10 | 53311224024 |
11 | 20677883733 |
12 | a3b99a2960 |
13 | 5047a81a96 |
14 | 281a3cc8d2 |
15 | 15c0413369 |
hex | c6998b8d8 |
53311224024 has 96 divisors (see below), whose sum is σ = 156886579200. Its totient is φ = 16292041920.
The previous prime is 53311224023. The next prime is 53311224047. The reversal of 53311224024 is 42042211335.
53311224024 is a `hidden beast` number, since 533 + 1 + 122 + 4 + 0 + 2 + 4 = 666.
It is a super-2 number, since 2×533112240242 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53311224023) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 586144 + ... + 670959.
It is an arithmetic number, because the mean of its divisors is an integer number (1634235200).
Almost surely, 253311224024 is an apocalyptic number.
It is an amenable number.
53311224024 is an abundant number, since it is smaller than the sum of its proper divisors (103575355176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53311224024 is a wasteful number, since it uses less digits than its factorization.
53311224024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1257165 (or 1257158 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 53311224024 its reverse (42042211335), we get a palindrome (95353435359).
The spelling of 53311224024 in words is "fifty-three billion, three hundred eleven million, two hundred twenty-four thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •