Base | Representation |
---|---|
bin | 1001011010101010… |
… | …11001010000000101 |
3 | 111001022220120110222 |
4 | 10231111121100011 |
5 | 40323210103334 |
6 | 2153353554125 |
7 | 236165320124 |
oct | 45525312005 |
9 | 14038816428 |
10 | 5055550469 |
11 | 21647a9992 |
12 | b91115945 |
13 | 62750b4a8 |
14 | 35d601abb |
15 | 1e8c7ad2e |
hex | 12d559405 |
5055550469 has 8 divisors (see below), whose sum is σ = 5232250968. Its totient is φ = 4881392640.
The previous prime is 5055550447. The next prime is 5055550471. The reversal of 5055550469 is 9640555505.
It can be written as a sum of positive squares in 4 ways, for example, as 392436100 + 4663114369 = 19810^2 + 68287^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5055550469 is a prime.
It is a super-2 number, since 2×50555504692 = 51117181089212239922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5055550069) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 631622 + ... + 639575.
It is an arithmetic number, because the mean of its divisors is an integer number (654031371).
Almost surely, 25055550469 is an apocalyptic number.
It is an amenable number.
5055550469 is a deficient number, since it is larger than the sum of its proper divisors (176700499).
5055550469 is a wasteful number, since it uses less digits than its factorization.
5055550469 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1271335.
The product of its (nonzero) digits is 675000, while the sum is 44.
The square root of 5055550469 is about 71102.3942564524. The cubic root of 5055550469 is about 1716.2853025891.
The spelling of 5055550469 in words is "five billion, fifty-five million, five hundred fifty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •