Base | Representation |
---|---|
bin | 1001100000100100… |
… | …00011001111000001 |
3 | 111011202222011000222 |
4 | 10300102003033001 |
5 | 40423340134010 |
6 | 2202321552425 |
7 | 240335554655 |
oct | 46022031701 |
9 | 14152864028 |
10 | 5105005505 |
11 | 218a708216 |
12 | ba57a5715 |
13 | 634835822 |
14 | 365dd6a65 |
15 | 1ed299355 |
hex | 1304833c1 |
5105005505 has 8 divisors (see below), whose sum is σ = 6131326632. Its totient is φ = 4080457728.
The previous prime is 5105005469. The next prime is 5105005541. The reversal of 5105005505 is 5055005015.
It is an interprime number because it is at equal distance from previous prime (5105005469) and next prime (5105005541).
It can be written as a sum of positive squares in 4 ways, for example, as 2946752656 + 2158252849 = 54284^2 + 46457^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5105005505 - 26 = 5105005441 is a prime.
It is a super-2 number, since 2×51050055052 = 52122162412160610050, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 436994 + ... + 448523.
It is an arithmetic number, because the mean of its divisors is an integer number (766415829).
Almost surely, 25105005505 is an apocalyptic number.
It is an amenable number.
5105005505 is a deficient number, since it is larger than the sum of its proper divisors (1026321127).
5105005505 is a wasteful number, since it uses less digits than its factorization.
5105005505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 886675.
The product of its (nonzero) digits is 3125, while the sum is 26.
The square root of 5105005505 is about 71449.3212354043. The cubic root of 5105005505 is about 1721.8635724662.
The spelling of 5105005505 in words is "five billion, one hundred five million, five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •