Base | Representation |
---|---|
bin | 101000001000110100111… |
… | …1011000101100111000001 |
3 | 201112101002102102002222022 |
4 | 1100101221323011213001 |
5 | 1210340310331331332 |
6 | 15422130235451225 |
7 | 1106361246500354 |
oct | 120215173054701 |
9 | 21471072362868 |
10 | 5516515105217 |
11 | 18375a4a63a46 |
12 | 7511798b6b15 |
13 | 31028890b83c |
14 | 15100210629b |
15 | 9876d199212 |
hex | 50469ec59c1 |
5516515105217 has 4 divisors (see below), whose sum is σ = 5516526266196. Its totient is φ = 5516503944240.
The previous prime is 5516515105147. The next prime is 5516515105219. The reversal of 5516515105217 is 7125015156155.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3823417086736 + 1693098018481 = 1955356^2 + 1301191^2 .
It is a cyclic number.
It is not a de Polignac number, because 5516515105217 - 216 = 5516515039681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5516515105219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4802978 + ... + 5839659.
It is an arithmetic number, because the mean of its divisors is an integer number (1379131566549).
Almost surely, 25516515105217 is an apocalyptic number.
It is an amenable number.
5516515105217 is a deficient number, since it is larger than the sum of its proper divisors (11160979).
5516515105217 is a wasteful number, since it uses less digits than its factorization.
5516515105217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11160978.
The product of its (nonzero) digits is 262500, while the sum is 44.
The spelling of 5516515105217 in words is "five trillion, five hundred sixteen billion, five hundred fifteen million, one hundred five thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •