Base | Representation |
---|---|
bin | 1000100101000100… |
… | …1000110101011100 |
3 | 12221111110001121200 |
4 | 2021101020311130 |
5 | 14204030034403 |
6 | 1020304355500 |
7 | 111032634555 |
oct | 21121106534 |
9 | 5844401550 |
10 | 2302971228 |
11 | a81a70408 |
12 | 543315b90 |
13 | 2a917568c |
14 | 17bc0332c |
15 | d72abca3 |
hex | 89448d5c |
2302971228 has 36 divisors (see below), whose sum is σ = 6127790760. Its totient is φ = 727253856.
The previous prime is 2302971199. The next prime is 2302971239. The reversal of 2302971228 is 8221792032.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 2302971192 and 2302971201.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 1682775 + ... + 1684142.
It is an arithmetic number, because the mean of its divisors is an integer number (170216410).
Almost surely, 22302971228 is an apocalyptic number.
It is an amenable number.
2302971228 is an abundant number, since it is smaller than the sum of its proper divisors (3824819532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2302971228 is a wasteful number, since it uses less digits than its factorization.
2302971228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3366946 (or 3366941 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 2302971228 is about 47989.2824284756. The cubic root of 2302971228 is about 1320.5742886771.
The spelling of 2302971228 in words is "two billion, three hundred two million, nine hundred seventy-one thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •