Base | Representation |
---|---|
bin | 11011011001011… |
… | …10000110011010 |
3 | 121000110102100000 |
4 | 31230232012122 |
5 | 432313430340 |
6 | 34445553430 |
7 | 5460332322 |
oct | 1554560632 |
9 | 530412300 |
10 | 229826970 |
11 | 10880544a |
12 | 64b75876 |
13 | 387cb5b9 |
14 | 22748282 |
15 | 1529bd30 |
hex | db2e19a |
229826970 has 96 divisors (see below), whose sum is σ = 623750400. Its totient is φ = 60886080.
The previous prime is 229826969. The next prime is 229826977. The reversal of 229826970 is 79628922.
It is a super-2 number, since 2×2298269702 = 105640872278761800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (229826977) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 658356 + ... + 658704.
It is an arithmetic number, because the mean of its divisors is an integer number (6497400).
Almost surely, 2229826970 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 229826970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (311875200).
229826970 is an abundant number, since it is smaller than the sum of its proper divisors (393923430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
229826970 is a wasteful number, since it uses less digits than its factorization.
229826970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642 (or 630 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 45.
The square root of 229826970 is about 15160.0451846292. The cubic root of 229826970 is about 612.5388852170.
The spelling of 229826970 in words is "two hundred twenty-nine million, eight hundred twenty-six thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •