Base | Representation |
---|---|
bin | 100101001000000011111… |
… | …1001110001011111001001 |
3 | 200001210120202001112212000 |
4 | 1022100013321301133021 |
5 | 1132100012223424230 |
6 | 14504025242541213 |
7 | 1034435016052425 |
oct | 112200771613711 |
9 | 20053522045760 |
10 | 5102553733065 |
11 | 1697a87617058 |
12 | 6a4aaab07809 |
13 | 2b0226997759 |
14 | 138d71a43b85 |
15 | 8cae0c4cb60 |
hex | 4a407e717c9 |
5102553733065 has 32 divisors (see below), whose sum is σ = 9548638569600. Its totient is φ = 2578132411200.
The previous prime is 5102553733063. The next prime is 5102553733073. The reversal of 5102553733065 is 5603373552015.
5102553733065 is a `hidden beast` number, since 5 + 1 + 0 + 2 + 553 + 7 + 3 + 30 + 65 = 666.
It is not a de Polignac number, because 5102553733065 - 21 = 5102553733063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 5102553733065.
It is not an unprimeable number, because it can be changed into a prime (5102553733063) 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, 994647286 + ... + 994652415.
It is an arithmetic number, because the mean of its divisors is an integer number (298394955300).
Almost surely, 25102553733065 is an apocalyptic number.
It is an amenable number.
5102553733065 is a deficient number, since it is larger than the sum of its proper divisors (4446084836535).
5102553733065 is a wasteful number, since it uses less digits than its factorization.
5102553733065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1989299734 (or 1989299728 counting only the distinct ones).
The product of its (nonzero) digits is 1417500, while the sum is 45.
The spelling of 5102553733065 in words is "five trillion, one hundred two billion, five hundred fifty-three million, seven hundred thirty-three thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •