Base | Representation |
---|---|
bin | 100001000100010… |
… | …001101010011010 |
3 | 1102122220012001212 |
4 | 201010101222122 |
5 | 2114010102200 |
6 | 131014343122 |
7 | 16514313323 |
oct | 4104215232 |
9 | 1378805055 |
10 | 554769050 |
11 | 265175220 |
12 | 13595aaa2 |
13 | 8ac20114 |
14 | 5397144a |
15 | 33a86035 |
hex | 21111a9a |
554769050 has 48 divisors (see below), whose sum is σ = 1131784704. Its totient is φ = 200640000.
The previous prime is 554769037. The next prime is 554769053. The reversal of 554769050 is 50967455.
It is a Smith number, since the sum of its digits (41) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 554768989 and 554769007.
It is not an unprimeable number, because it can be changed into a prime (554769053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 102410 + ... + 107690.
It is an arithmetic number, because the mean of its divisors is an integer number (23578848).
Almost surely, 2554769050 is an apocalyptic number.
554769050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
554769050 is an abundant number, since it is smaller than the sum of its proper divisors (577015654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
554769050 is a wasteful number, since it uses less digits than its factorization.
554769050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5495 (or 5490 counting only the distinct ones).
The product of its (nonzero) digits is 189000, while the sum is 41.
The square root of 554769050 is about 23553.5358279813. The cubic root of 554769050 is about 821.6825703307.
The spelling of 554769050 in words is "five hundred fifty-four million, seven hundred sixty-nine thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •