Base | Representation |
---|---|
bin | 110001101001101101… |
… | …011011000001111110 |
3 | 12002121111001020012000 |
4 | 301221231123001332 |
5 | 1333141124404210 |
6 | 40254113123130 |
7 | 3565102030551 |
oct | 615155330176 |
9 | 162544036160 |
10 | 53313122430 |
11 | 2067895aa67 |
12 | a3ba5594a6 |
13 | 5048297bb9 |
14 | 281a764698 |
15 | 15c068aac0 |
hex | c69b5b07e |
53313122430 has 64 divisors (see below), whose sum is σ = 142523150400. Its totient is φ = 14181350400.
The previous prime is 53313122411. The next prime is 53313122431. The reversal of 53313122430 is 3422131335.
53313122430 is a `hidden beast` number, since 533 + 1 + 3 + 122 + 4 + 3 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 53313122394 and 53313122403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53313122431) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 137935 + ... + 354474.
It is an arithmetic number, because the mean of its divisors is an integer number (2226924225).
Almost surely, 253313122430 is an apocalyptic number.
53313122430 is an abundant number, since it is smaller than the sum of its proper divisors (89210027970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53313122430 is a wasteful number, since it uses less digits than its factorization.
53313122430 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 492826 (or 492820 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 53313122430 its reverse (3422131335), we get a palindrome (56735253765).
The spelling of 53313122430 in words is "fifty-three billion, three hundred thirteen million, one hundred twenty-two thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •