Base | Representation |
---|---|
bin | 11011010110110… |
… | …00101010001000 |
3 | 120222210122021011 |
4 | 31223120222020 |
5 | 432221231000 |
6 | 34434253304 |
7 | 5454344104 |
oct | 1553305210 |
9 | 528718234 |
10 | 229477000 |
11 | 108596515 |
12 | 64a27234 |
13 | 3870820c |
14 | 22696904 |
15 | 1522d2ba |
hex | dad8a88 |
229477000 has 128 divisors (see below), whose sum is σ = 571989600. Its totient is φ = 86016000.
The previous prime is 229476991. The next prime is 229477013. The reversal of 229477000 is 774922.
It is a happy number.
It can be written as a sum of positive squares in 16 ways, for example, as 77053284 + 152423716 = 8778^2 + 12346^2 .
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1188904 + ... + 1189096.
Almost surely, 2229477000 is an apocalyptic number.
229477000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 229477000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (285994800).
229477000 is an abundant number, since it is smaller than the sum of its proper divisors (342512600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
229477000 is a wasteful number, since it uses less digits than its factorization.
229477000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284 (or 270 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 31.
The square root of 229477000 is about 15148.4982754067. The cubic root of 229477000 is about 612.2278118663.
The spelling of 229477000 in words is "two hundred twenty-nine million, four hundred seventy-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •