Base | Representation |
---|---|
bin | 1000001101010110… |
… | …0000000000000000 |
3 | 12200120011221001211 |
4 | 2003111200000000 |
5 | 14003040421032 |
6 | 1002351335504 |
7 | 105414012352 |
oct | 20325400000 |
9 | 5616157054 |
10 | 2203451392 |
11 | a3087770a |
12 | 515b21594 |
13 | 29166c5bc |
14 | 16c8d90d2 |
15 | cd69e747 |
hex | 83560000 |
2203451392 has 36 divisors (see below), whose sum is σ = 4407148116. Its totient is φ = 1101660160.
The previous prime is 2203451377. The next prime is 2203451399. The reversal of 2203451392 is 2931543022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2203451399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122667 + ... + 139477.
It is an arithmetic number, because the mean of its divisors is an integer number (122420781).
Almost surely, 22203451392 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 2203451392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2203574058).
2203451392 is an abundant number, since it is smaller than the sum of its proper divisors (2203696724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2203451392 is an frugal number, since it uses more digits than its factorization.
2203451392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16845 (or 16813 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 31.
The square root of 2203451392 is about 46940.9351419419. The cubic root of 2203451392 is about 1301.2712204222.
The spelling of 2203451392 in words is "two billion, two hundred three million, four hundred fifty-one thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •