Base | Representation |
---|---|
bin | 110001011000001111… |
… | …010100110101001010 |
3 | 12001212001112002022000 |
4 | 301120033110311022 |
5 | 1332041111120132 |
6 | 40205043011430 |
7 | 3554612506623 |
oct | 613017246512 |
9 | 161761462260 |
10 | 53020020042 |
11 | 20538467890 |
12 | a338369b76 |
13 | 4ccc643832 |
14 | 27cd868a4a |
15 | 15a4a9087c |
hex | c583d4d4a |
53020020042 has 64 divisors (see below), whose sum is σ = 129734784000. Its totient is φ = 15916497840.
The previous prime is 53020020023. The next prime is 53020020059. The reversal of 53020020042 is 24002002035.
It is a super-2 number, since 2×530200200422 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 53020019997 and 53020020024.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 353542 + ... + 480657.
It is an arithmetic number, because the mean of its divisors is an integer number (2027106000).
Almost surely, 253020020042 is an apocalyptic number.
53020020042 is an abundant number, since it is smaller than the sum of its proper divisors (76714763958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53020020042 is a wasteful number, since it uses less digits than its factorization.
53020020042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 834328 (or 834322 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 18.
Adding to 53020020042 its reverse (24002002035), we get a palindrome (77022022077).
The spelling of 53020020042 in words is "fifty-three billion, twenty million, twenty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •