Base | Representation |
---|---|
bin | 1010010000001111… |
… | …11100101110101111 |
3 | 112012122122111212202 |
4 | 11020013330232233 |
5 | 42233240314412 |
6 | 2310131252115 |
7 | 253263550415 |
oct | 51007745657 |
9 | 15178574782 |
10 | 5505010607 |
11 | 2375486a48 |
12 | 109774a03b |
13 | 699679535 |
14 | 3a319d2b5 |
15 | 22345e3c2 |
hex | 1481fcbaf |
5505010607 has 8 divisors (see below), whose sum is σ = 5574825984. Its totient is φ = 5435278488.
The previous prime is 5505010559. The next prime is 5505010633. The reversal of 5505010607 is 7060105055.
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 5505010607 - 210 = 5505009583 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5505010607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5505010507) 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 7 ways as a sum of consecutive naturals, for example, 118088 + ... + 157970.
It is an arithmetic number, because the mean of its divisors is an integer number (696853248).
Almost surely, 25505010607 is an apocalyptic number.
5505010607 is a deficient number, since it is larger than the sum of its proper divisors (69815377).
5505010607 is a wasteful number, since it uses less digits than its factorization.
5505010607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41629.
The product of its (nonzero) digits is 5250, while the sum is 29.
The square root of 5505010607 is about 74195.7586860597. The cubic root of 5505010607 is about 1765.7100409681.
The spelling of 5505010607 in words is "five billion, five hundred five million, ten thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •