Base | Representation |
---|---|
bin | 110001110000010001… |
… | …101110100101110111 |
3 | 12002220011100222120000 |
4 | 301300101232211313 |
5 | 1333402331144111 |
6 | 40313050442343 |
7 | 3600610404030 |
oct | 616021564567 |
9 | 162804328500 |
10 | 53423303031 |
11 | 2072507530a |
12 | a42b4333b3 |
13 | 5065064517 |
14 | 282b245a87 |
15 | 15ca1a1c56 |
hex | c7046e977 |
53423303031 has 40 divisors (see below), whose sum is σ = 93430496544. Its totient is φ = 29783013120.
The previous prime is 53423303023. The next prime is 53423303041. The reversal of 53423303031 is 13030332435.
It is a happy number.
It is not a de Polignac number, because 53423303031 - 23 = 53423303023 is a prime.
It is a super-2 number, since 2×534233030312 (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 junction number, because it is equal to n+sod(n) for n = 53423302986 and 53423303004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53423303041) by changing a digit.
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 39 ways as a sum of consecutive naturals, for example, 1125790 + ... + 1172283.
Almost surely, 253423303031 is an apocalyptic number.
53423303031 is a deficient number, since it is larger than the sum of its proper divisors (40007193513).
53423303031 is a wasteful number, since it uses less digits than its factorization.
53423303031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2298133 (or 2298124 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 27.
Adding to 53423303031 its reverse (13030332435), we get a palindrome (66453635466).
The spelling of 53423303031 in words is "fifty-three billion, four hundred twenty-three million, three hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •