Base | Representation |
---|---|
bin | 1010010000001001… |
… | …00100001011010101 |
3 | 112012120222110010211 |
4 | 11020010210023111 |
5 | 42233023423410 |
6 | 2310100245421 |
7 | 253253164411 |
oct | 51004441325 |
9 | 15176873124 |
10 | 5504123605 |
11 | 2374a30592 |
12 | 10973a0871 |
13 | 699428896 |
14 | 3a300bd41 |
15 | 22333668a |
hex | 1481242d5 |
5504123605 has 4 divisors (see below), whose sum is σ = 6604948332. Its totient is φ = 4403298880.
The previous prime is 5504123587. The next prime is 5504123621. The reversal of 5504123605 is 5063214055.
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 2510611236 + 2993512369 = 50106^2 + 54713^2 .
It is a de Polignac number, because none of the positive numbers 2k-5504123605 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a plaindrome in base 15.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550412356 + ... + 550412365.
It is an arithmetic number, because the mean of its divisors is an integer number (1651237083).
Almost surely, 25504123605 is an apocalyptic number.
It is an amenable number.
5504123605 is a deficient number, since it is larger than the sum of its proper divisors (1100824727).
5504123605 is a wasteful number, since it uses less digits than its factorization.
5504123605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1100824726.
The product of its (nonzero) digits is 18000, while the sum is 31.
The square root of 5504123605 is about 74189.7810011595. The cubic root of 5504123605 is about 1765.6152017646.
The spelling of 5504123605 in words is "five billion, five hundred four million, one hundred twenty-three thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •