Base | Representation |
---|---|
bin | 11011001100011… |
… | …10000001101010 |
3 | 120220020211120000 |
4 | 31212032001222 |
5 | 431344411410 |
6 | 34345243430 |
7 | 5440003563 |
oct | 1546160152 |
9 | 526224500 |
10 | 228122730 |
11 | 107850a90 |
12 | 64493576 |
13 | 38352984 |
14 | 2242316a |
15 | 15061dc0 |
hex | d98e06a |
228122730 has 80 divisors (see below), whose sum is σ = 669186144. Its totient is φ = 55300320.
The previous prime is 228122693. The next prime is 228122731. The reversal of 228122730 is 37221822.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 228122694 and 228122703.
It is not an unprimeable number, because it can be changed into a prime (228122731) by changing a digit.
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 39 ways as a sum of consecutive naturals, for example, 3892 + ... + 21711.
Almost surely, 2228122730 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 228122730, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (334593072).
228122730 is an abundant number, since it is smaller than the sum of its proper divisors (441063414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
228122730 is a wasteful number, since it uses less digits than its factorization.
228122730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25633 (or 25624 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 228122730 is about 15103.7323201916. The cubic root of 228122730 is about 611.0210705052.
The spelling of 228122730 in words is "two hundred twenty-eight million, one hundred twenty-two thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •