Base | Representation |
---|---|
bin | 11011010110011… |
… | …10000010000000 |
3 | 120222201102120000 |
4 | 31223032002000 |
5 | 432213332342 |
6 | 34433320000 |
7 | 5454103152 |
oct | 1553160200 |
9 | 528642500 |
10 | 229433472 |
11 | 108566844 |
12 | 64a06000 |
13 | 386c1468 |
14 | 22684ad2 |
15 | 1522044c |
hex | dace080 |
229433472 has 80 divisors (see below), whose sum is σ = 682821150. Its totient is φ = 76474368.
The previous prime is 229433453. The next prime is 229433507. The reversal of 229433472 is 274334922.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 137733696 + 91699776 = 11736^2 + 9576^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
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 9 ways as a sum of consecutive naturals, for example, 697 + ... + 21432.
Almost surely, 2229433472 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 229433472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (341410575).
229433472 is an abundant number, since it is smaller than the sum of its proper divisors (453387678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
229433472 is an equidigital number, since it uses as much as digits as its factorization.
229433472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22155 (or 22134 counting only the distinct ones).
The product of its digits is 72576, while the sum is 36.
The square root of 229433472 is about 15147.0614972014. The cubic root of 229433472 is about 612.1890995810.
The spelling of 229433472 in words is "two hundred twenty-nine million, four hundred thirty-three thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •