Base | Representation |
---|---|
bin | 110001011100001100… |
… | …011010101000100010 |
3 | 12002000200100211011200 |
4 | 301130030122220202 |
5 | 1332210102204432 |
6 | 40215413022030 |
7 | 3556346445030 |
oct | 613414325042 |
9 | 162020324150 |
10 | 53086366242 |
11 | 20571962758 |
12 | a356624916 |
13 | 5010303240 |
14 | 27d85b9550 |
15 | 15aa7e8a7c |
hex | c5c31aa22 |
53086366242 has 384 divisors, whose sum is σ = 153856475136. Its totient is φ = 12834256896.
The previous prime is 53086366241. The next prime is 53086366279. The reversal of 53086366242 is 24266368035.
It is a happy number.
53086366242 is a `hidden beast` number, since 5 + 3 + 0 + 8 + 636 + 6 + 2 + 4 + 2 = 666.
It is a super-3 number, since 3×530863662423 (a number of 33 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (53086366241) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 238055343 + ... + 238055565.
It is an arithmetic number, because the mean of its divisors is an integer number (400667904).
Almost surely, 253086366242 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53086366242, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76928237568).
53086366242 is an abundant number, since it is smaller than the sum of its proper divisors (100770108894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53086366242 is a wasteful number, since it uses less digits than its factorization.
53086366242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454 (or 451 counting only the distinct ones).
The product of its (nonzero) digits is 1244160, while the sum is 45.
The spelling of 53086366242 in words is "fifty-three billion, eighty-six million, three hundred sixty-six thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •