Base | Representation |
---|---|
bin | 1001100000101000… |
… | …00110111111110101 |
3 | 111011210222120100212 |
4 | 10300110012333311 |
5 | 40424004421310 |
6 | 2202341315205 |
7 | 240343263305 |
oct | 46024067765 |
9 | 14153876325 |
10 | 5105545205 |
11 | 218aa46752 |
12 | ba5a05b05 |
13 | 634994387 |
14 | 3660d7605 |
15 | 1ed354205 |
hex | 130506ff5 |
5105545205 has 8 divisors (see below), whose sum is σ = 6136652472. Its totient is φ = 4077770688.
The previous prime is 5105545201. The next prime is 5105545223. The reversal of 5105545205 is 5025455015.
It can be written as a sum of positive squares in 4 ways, for example, as 121044004 + 4984501201 = 11002^2 + 70601^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 5105545205 - 22 = 5105545201 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105545201) by changing a digit.
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 in 7 ways as a sum of consecutive naturals, for example, 829814 + ... + 835943.
It is an arithmetic number, because the mean of its divisors is an integer number (767081559).
Almost surely, 25105545205 is an apocalyptic number.
It is an amenable number.
5105545205 is a deficient number, since it is larger than the sum of its proper divisors (1031107267).
5105545205 is a wasteful number, since it uses less digits than its factorization.
5105545205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1666375.
The product of its (nonzero) digits is 25000, while the sum is 32.
The square root of 5105545205 is about 71453.0979384379. The cubic root of 5105545205 is about 1721.9242486674.
The spelling of 5105545205 in words is "five billion, one hundred five million, five hundred forty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •