Base | Representation |
---|---|
bin | 1000010011000001… |
… | …0100110110011100 |
3 | 12202012222120110210 |
4 | 2010300110312130 |
5 | 14030134321303 |
6 | 1005001532420 |
7 | 106123255542 |
oct | 20460246634 |
9 | 5665876423 |
10 | 2227260828 |
11 | a4325a031 |
12 | 521aa4110 |
13 | 296587920 |
14 | 171b35d92 |
15 | d0804203 |
hex | 84c14d9c |
2227260828 has 24 divisors (see below), whose sum is σ = 5596707088. Its totient is φ = 685310976.
The previous prime is 2227260823. The next prime is 2227260839. The reversal of 2227260828 is 8280627222.
It is a super-4 number, since 4×22272608284 (a number of 38 digits) contains 4444 as substring.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2227260823) 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 7 ways as a sum of consecutive naturals, for example, 7138501 + ... + 7138812.
Almost surely, 22227260828 is an apocalyptic number.
It is an amenable number.
2227260828 is an abundant number, since it is smaller than the sum of its proper divisors (3369446260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2227260828 is a wasteful number, since it uses less digits than its factorization.
2227260828 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14277333 (or 14277331 counting only the distinct ones).
The product of its (nonzero) digits is 86016, while the sum is 39.
The square root of 2227260828 is about 47193.8643045894. The cubic root of 2227260828 is about 1305.9414096463.
The spelling of 2227260828 in words is "two billion, two hundred twenty-seven million, two hundred sixty thousand, eight hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •