Base | Representation |
---|---|
bin | 110001011000010000… |
… | …001111011111010010 |
3 | 12001212001222021212200 |
4 | 301120100033133102 |
5 | 1332041141312211 |
6 | 40205052104030 |
7 | 3554614530246 |
oct | 613020173722 |
9 | 161761867780 |
10 | 53020260306 |
11 | 20538611352 |
12 | a338465016 |
13 | 4ccc6c8cc0 |
14 | 27cd8cc426 |
15 | 15a4adbb56 |
hex | c5840f7d2 |
53020260306 has 24 divisors (see below), whose sum is σ = 123713941260. Its totient is φ = 16313926176.
The previous prime is 53020260301. The next prime is 53020260329. The reversal of 53020260306 is 60306202035.
53020260306 is a `hidden beast` number, since 5 + 30 + 20 + 2 + 603 + 0 + 6 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 52994342025 + 25918281 = 230205^2 + 5091^2 .
It is a super-2 number, since 2×530202603062 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 53020260306.
It is not an unprimeable number, because it can be changed into a prime (53020260301) 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 11 ways as a sum of consecutive naturals, for example, 113290921 + ... + 113291388.
Almost surely, 253020260306 is an apocalyptic number.
53020260306 is an abundant number, since it is smaller than the sum of its proper divisors (70693680954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53020260306 is a wasteful number, since it uses less digits than its factorization.
53020260306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226582330 (or 226582327 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The spelling of 53020260306 in words is "fifty-three billion, twenty million, two hundred sixty thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •