Base | Representation |
---|---|
bin | 1101010101001101011… |
… | …0010001011101000000 |
3 | 210220011121101111101110 |
4 | 3111103112101131000 |
5 | 12223024043124042 |
6 | 253114330203320 |
7 | 22355421412566 |
oct | 3252326213500 |
9 | 726147344343 |
10 | 229031614272 |
11 | 8914a41474a |
12 | 3847a283540 |
13 | 1879cb95a66 |
14 | b129a8ba36 |
15 | 5e5706409c |
hex | 3553591740 |
229031614272 has 112 divisors (see below), whose sum is σ = 642155688000. Its totient is φ = 71840194560.
The previous prime is 229031614271. The next prime is 229031614277. The reversal of 229031614272 is 272416130922.
It is a self number, because there is not a number n which added to its sum of digits gives 229031614272.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (229031614271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 332872 + ... + 754232.
Almost surely, 2229031614272 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 229031614272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (321077844000).
229031614272 is an abundant number, since it is smaller than the sum of its proper divisors (413124073728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
229031614272 is a wasteful number, since it uses less digits than its factorization.
229031614272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421544 (or 421534 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 39.
The spelling of 229031614272 in words is "two hundred twenty-nine billion, thirty-one million, six hundred fourteen thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •