Base | Representation |
---|---|
bin | 1000011001001110… |
… | …1011111000000000 |
3 | 12211000222212122100 |
4 | 2012103223320000 |
5 | 14103321314032 |
6 | 1011332110400 |
7 | 106560540210 |
oct | 20623537000 |
9 | 5730885570 |
10 | 2253307392 |
11 | a56a2a216 |
12 | 52a765400 |
13 | 29baa72ab |
14 | 175396240 |
15 | d2c4b97c |
hex | 864ebe00 |
2253307392 has 120 divisors (see below), whose sum is σ = 7432332336. Its totient is φ = 643792896.
The previous prime is 2253307379. The next prime is 2253307393. The reversal of 2253307392 is 2937033522.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2253307393) 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 11 ways as a sum of consecutive naturals, for example, 2673 + ... + 67184.
Almost surely, 22253307392 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 2253307392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3716166168).
2253307392 is an abundant number, since it is smaller than the sum of its proper divisors (5179024944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2253307392 is an equidigital number, since it uses as much as digits as its factorization.
2253307392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69888 (or 69869 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 36.
The square root of 2253307392 is about 47469.0150729926. The cubic root of 2253307392 is about 1311.0124434373.
The spelling of 2253307392 in words is "two billion, two hundred fifty-three million, three hundred seven thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •