Base | Representation |
---|---|
bin | 10111101111010000010110… |
… | …10101010100111001110001 |
3 | 20211211101110221221010210010 |
4 | 23313220023111110321301 |
5 | 23320231100444434401 |
6 | 303004524410125133 |
7 | 13665261650320605 |
oct | 1367501325247161 |
9 | 224741427833703 |
10 | 52201222655601 |
11 | 156a6461340348 |
12 | 5a30b43a207a9 |
13 | 23187286a0a66 |
14 | cc67a46c5505 |
15 | 607d185c4ed6 |
hex | 2f7a0b554e71 |
52201222655601 has 16 divisors (see below), whose sum is σ = 70665898953024. Its totient is φ = 34269054825984.
The previous prime is 52201222655599. The next prime is 52201222655623. The reversal of 52201222655601 is 10655622210225.
It is not a de Polignac number, because 52201222655601 - 21 = 52201222655599 is a prime.
It is a super-2 number, since 2×522012226556012 (a number of 28 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 52201222655601.
It is not an unprimeable number, because it can be changed into a prime (52201222655401) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46202280 + ... + 47318633.
It is an arithmetic number, because the mean of its divisors is an integer number (4416618684564).
Almost surely, 252201222655601 is an apocalyptic number.
It is an amenable number.
52201222655601 is a deficient number, since it is larger than the sum of its proper divisors (18464676297423).
52201222655601 is a wasteful number, since it uses less digits than its factorization.
52201222655601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93523760.
The product of its (nonzero) digits is 144000, while the sum is 39.
Adding to 52201222655601 its reverse (10655622210225), we get a palindrome (62856844865826).
The spelling of 52201222655601 in words is "fifty-two trillion, two hundred one billion, two hundred twenty-two million, six hundred fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •