Base | Representation |
---|---|
bin | 110001101001000011… |
… | …110001001101111101 |
3 | 12002120201111110220100 |
4 | 301221003301031331 |
5 | 1333130331001021 |
6 | 40253043111313 |
7 | 3564610152336 |
oct | 615103611575 |
9 | 162521443810 |
10 | 53302203261 |
11 | 2067278225a |
12 | a3b6972539 |
13 | 5045c43b58 |
14 | 281912128d |
15 | 15be730626 |
hex | c690f137d |
53302203261 has 24 divisors (see below), whose sum is σ = 83838924000. Its totient is φ = 32503699872.
The previous prime is 53302203209. The next prime is 53302203307. The reversal of 53302203261 is 16230220335.
53302203261 is a `hidden beast` number, since 5 + 330 + 2 + 2 + 0 + 326 + 1 = 666.
It is not a de Polignac number, because 53302203261 - 214 = 53302186877 is a prime.
It is a super-2 number, since 2×533022032612 (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 (53302203061) 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 23 ways as a sum of consecutive naturals, for example, 5369331 + ... + 5379248.
It is an arithmetic number, because the mean of its divisors is an integer number (3493288500).
Almost surely, 253302203261 is an apocalyptic number.
It is an amenable number.
53302203261 is a deficient number, since it is larger than the sum of its proper divisors (30536720739).
53302203261 is a wasteful number, since it uses less digits than its factorization.
53302203261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10748633 (or 10748630 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 53302203261 its reverse (16230220335), we get a palindrome (69532423596).
The spelling of 53302203261 in words is "fifty-three billion, three hundred two million, two hundred three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •