Base | Representation |
---|---|
bin | 10111101100011101101101… |
… | …00100010111111010011101 |
3 | 20211111012220201201020012000 |
4 | 23312032312210113322131 |
5 | 23312143134140144341 |
6 | 302452503300032513 |
7 | 13655325121012536 |
oct | 1366166644277235 |
9 | 224435821636160 |
10 | 52105311256221 |
11 | 15669813904423 |
12 | 5a16437392739 |
13 | 230c681c64a32 |
14 | cc1ca667d68d |
15 | 6055a32b28b6 |
hex | 2f63b6917e9d |
52105311256221 has 48 divisors (see below), whose sum is σ = 81487608952320. Its totient is φ = 32901374344320.
The previous prime is 52105311256199. The next prime is 52105311256223. The reversal of 52105311256221 is 12265211350125.
52105311256221 is a `hidden beast` number, since 5 + 2 + 1 + 0 + 5 + 3 + 1 + 1 + 25 + 622 + 1 = 666.
It is not a de Polignac number, because 52105311256221 - 210 = 52105311255197 is a prime.
It is a super-2 number, since 2×521053112562212 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52105311256223) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 43870036 + ... + 45042098.
It is an arithmetic number, because the mean of its divisors is an integer number (1697658519840).
Almost surely, 252105311256221 is an apocalyptic number.
It is an amenable number.
52105311256221 is a deficient number, since it is larger than the sum of its proper divisors (29382297696099).
52105311256221 is a wasteful number, since it uses less digits than its factorization.
52105311256221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1176671 (or 1176646 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 36.
The spelling of 52105311256221 in words is "fifty-two trillion, one hundred five billion, three hundred eleven million, two hundred fifty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •