Base | Representation |
---|---|
bin | 100001000011101… |
… | …011110011100110 |
3 | 1102122121022100220 |
4 | 201003223303212 |
5 | 2113440121430 |
6 | 131011145210 |
7 | 16513066260 |
oct | 4103536346 |
9 | 1378538326 |
10 | 554613990 |
11 | 265079777 |
12 | 1358a5206 |
13 | 8ab97678 |
14 | 53930b30 |
15 | 33a55110 |
hex | 210ebce6 |
554613990 has 128 divisors (see below), whose sum is σ = 1618928640. Its totient is φ = 118775808.
The previous prime is 554613977. The next prime is 554613991. The reversal of 554613990 is 99316455.
554613990 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (554613991) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 386314 + ... + 387746.
It is an arithmetic number, because the mean of its divisors is an integer number (12647880).
Almost surely, 2554613990 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 554613990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (809464320).
554613990 is an abundant number, since it is smaller than the sum of its proper divisors (1064314650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
554613990 is a wasteful number, since it uses less digits than its factorization.
554613990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1566.
The product of its (nonzero) digits is 145800, while the sum is 42.
The square root of 554613990 is about 23550.2439477811. The cubic root of 554613990 is about 821.6060087586.
The spelling of 554613990 in words is "five hundred fifty-four million, six hundred thirteen thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •