Base | Representation |
---|---|
bin | 100110001101110100100… |
… | …1000100010100010011000 |
3 | 200121010021002112210020201 |
4 | 1030123221020202202120 |
5 | 1142023314002200111 |
6 | 15100522420231544 |
7 | 1051320260655646 |
oct | 114335110424230 |
9 | 20533232483221 |
10 | 5252361365656 |
11 | 1745572075779 |
12 | 709b3923b5b4 |
13 | 2c13ac432a32 |
14 | 142303a3c196 |
15 | 9195c9ce6c1 |
hex | 4c6e9222898 |
5252361365656 has 8 divisors (see below), whose sum is σ = 9848177560620. Its totient is φ = 2626180682824.
The previous prime is 5252361365617. The next prime is 5252361365711. The reversal of 5252361365656 is 6565631632525.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×52523613656562 (a number of 26 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (55) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 5252361365597 and 5252361365606.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 328272585346 + ... + 328272585361.
Almost surely, 25252361365656 is an apocalyptic number.
It is an amenable number.
5252361365656 is a deficient number, since it is larger than the sum of its proper divisors (4595816194964).
5252361365656 is a wasteful number, since it uses less digits than its factorization.
5252361365656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 656545170713 (or 656545170709 counting only the distinct ones).
The product of its digits is 29160000, while the sum is 55.
The spelling of 5252361365656 in words is "five trillion, two hundred fifty-two billion, three hundred sixty-one million, three hundred sixty-five thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •