Base | Representation |
---|---|
bin | 11110001000100… |
… | …001110011101000 |
3 | 1022020021201010000 |
4 | 132020201303220 |
5 | 2013410131404 |
6 | 122055423000 |
7 | 15346056561 |
oct | 3610416350 |
9 | 1266251100 |
10 | 505552104 |
11 | 23a409862 |
12 | 121384a60 |
13 | 8097a275 |
14 | 4b1dd168 |
15 | 2e5b3339 |
hex | 1e221ce8 |
505552104 has 40 divisors (see below), whose sum is σ = 1416015810. Its totient is φ = 168517152.
The previous prime is 505552081. The next prime is 505552109. The reversal of 505552104 is 401255505.
505552104 is a `hidden beast` number, since 5 + 0 + 5 + 552 + 104 = 666.
It can be written as a sum of positive squares in only one way, i.e., 265364100 + 240188004 = 16290^2 + 15498^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (505552109) 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 9 ways as a sum of consecutive naturals, for example, 389439 + ... + 390734.
Almost surely, 2505552104 is an apocalyptic number.
505552104 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
It is an amenable number.
505552104 is an abundant number, since it is smaller than the sum of its proper divisors (910463706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505552104 is a wasteful number, since it uses less digits than its factorization.
505552104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 780191 (or 780178 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 27.
The square root of 505552104 is about 22484.4858513598. The cubic root of 505552104 is about 796.6275238165.
The spelling of 505552104 in words is "five hundred five million, five hundred fifty-two thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •