Base | Representation |
---|---|
bin | 10100111111011000001011 |
3 | 101100112222101 |
4 | 110333120023 |
5 | 2402034400 |
6 | 313534231 |
7 | 64525126 |
oct | 24773013 |
9 | 11315871 |
10 | 5502475 |
11 | 3119100 |
12 | 1a14377 |
13 | 11a8704 |
14 | a333bd |
15 | 73a56a |
hex | 53f60b |
5502475 has 36 divisors (see below), whose sum is σ = 8015112. Its totient is φ = 3731200.
The previous prime is 5502463. The next prime is 5502479. The reversal of 5502475 is 5742055.
It is not a de Polignac number, because 5502475 - 213 = 5494283 is a prime.
It is a super-2 number, since 2×55024752 = 60554462251250, which contains 22 as substring.
It is a Duffinian number.
5502475 is a modest number, since divided by 2475 gives 550 as remainder.
5502475 is a lucky number.
It is not an unprimeable number, because it can be changed into a prime (5502479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 51372 + ... + 51478.
It is an arithmetic number, because the mean of its divisors is an integer number (222642).
Almost surely, 25502475 is an apocalyptic number.
5502475 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5502475 is a deficient number, since it is larger than the sum of its proper divisors (2512637).
5502475 is a wasteful number, since it uses less digits than its factorization.
5502475 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156 (or 140 counting only the distinct ones).
The product of its (nonzero) digits is 7000, while the sum is 28.
The square root of 5502475 is about 2345.7354923350. The cubic root of 5502475 is about 176.5438904082.
It can be divided in two parts, 550 and 2475, that added together give a square (3025 = 552).
The spelling of 5502475 in words is "five million, five hundred two thousand, four hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •