Base | Representation |
---|---|
bin | 10111101011011001000100… |
… | …10111101100110100101101 |
3 | 20211100200210212021222211100 |
4 | 23311230202113230310231 |
5 | 23311042204040331121 |
6 | 302423531144313313 |
7 | 13652552051305035 |
oct | 1365544227546455 |
9 | 224320725258740 |
10 | 52068465167661 |
11 | 1565512618a768 |
12 | 5a0b273772839 |
13 | 230905c435077 |
14 | cc01acd008c5 |
15 | 604648623026 |
hex | 2f5b225ecd2d |
52068465167661 has 24 divisors (see below), whose sum is σ = 75228758579520. Its totient is φ = 34703655624000.
The previous prime is 52068465167657. The next prime is 52068465167671. The reversal of 52068465167661 is 16676156486025.
It is a happy number.
52068465167661 is a `hidden beast` number, since 5 + 2 + 0 + 6 + 8 + 46 + 516 + 76 + 6 + 1 = 666.
It is not a de Polignac number, because 52068465167661 - 22 = 52068465167657 is a prime.
It is a super-2 number, since 2×520684651676612 (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 (52068465167671) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1117301761 + ... + 1117348361.
It is an arithmetic number, because the mean of its divisors is an integer number (3134531607480).
Almost surely, 252068465167661 is an apocalyptic number.
It is an amenable number.
52068465167661 is a deficient number, since it is larger than the sum of its proper divisors (23160293411859).
52068465167661 is a wasteful number, since it uses less digits than its factorization.
52068465167661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74897 (or 74894 counting only the distinct ones).
The product of its (nonzero) digits is 87091200, while the sum is 63.
The spelling of 52068465167661 in words is "fifty-two trillion, sixty-eight billion, four hundred sixty-five million, one hundred sixty-seven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •