Base | Representation |
---|---|
bin | 100111000010011100010… |
… | …0100111001000001100000 |
3 | 200222220221101201020121110 |
4 | 1032010320210321001200 |
5 | 1200401231004110202 |
6 | 15224451445023320 |
7 | 1062430463655135 |
oct | 116047044710140 |
9 | 20886841636543 |
10 | 5365363347552 |
11 | 178948a80a25a |
12 | 727a153b4b40 |
13 | 2cbc4a859290 |
14 | 1479837c258c |
15 | 9487340d26c |
hex | 4e138939060 |
5365363347552 has 192 divisors, whose sum is σ = 16355169008640. Its totient is φ = 1525846118400.
The previous prime is 5365363347551. The next prime is 5365363347581. The reversal of 5365363347552 is 2557433635635.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a junction number, because it is equal to n+sod(n) for n = 5365363347492 and 5365363347501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5365363347551) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1787224 + ... + 3731607.
It is an arithmetic number, because the mean of its divisors is an integer number (85183171920).
Almost surely, 25365363347552 is an apocalyptic number.
5365363347552 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5365363347552 is an abundant number, since it is smaller than the sum of its proper divisors (10989805661088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5365363347552 is a wasteful number, since it uses less digits than its factorization.
5365363347552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5518917 (or 5518909 counting only the distinct ones).
The product of its digits is 102060000, while the sum is 57.
The spelling of 5365363347552 in words is "five trillion, three hundred sixty-five billion, three hundred sixty-three million, three hundred forty-seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •