Base | Representation |
---|---|
bin | 1000010100011001… |
… | …1010110011100000 |
3 | 12202121212210222212 |
4 | 2011012122303200 |
5 | 14033130134014 |
6 | 1005330021252 |
7 | 106223426543 |
oct | 20506326340 |
9 | 5677783885 |
10 | 2233052384 |
11 | a46555342 |
12 | 523a17828 |
13 | 297834a94 |
14 | 17280285a |
15 | d109a23e |
hex | 8519ace0 |
2233052384 has 12 divisors (see below), whose sum is σ = 4396321944. Its totient is φ = 1116526176.
The previous prime is 2233052383. The next prime is 2233052389. The reversal of 2233052384 is 4832503322.
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 69782887 = 2233052384 / (2 + 2 + 3 + 3 + 0 + 5 + 2 + 3 + 8 + 4).
It is a self number, because there is not a number n which added to its sum of digits gives 2233052384.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2233052383) 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 as a sum of consecutive naturals, namely, 34891412 + ... + 34891475.
It is an arithmetic number, because the mean of its divisors is an integer number (366360162).
Almost surely, 22233052384 is an apocalyptic number.
It is an amenable number.
2233052384 is a deficient number, since it is larger than the sum of its proper divisors (2163269560).
2233052384 is an equidigital number, since it uses as much as digits as its factorization.
2233052384 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69782897 (or 69782889 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 32.
The square root of 2233052384 is about 47255.1836733284. The cubic root of 2233052384 is about 1307.0723782967.
The spelling of 2233052384 in words is "two billion, two hundred thirty-three million, fifty-two thousand, three hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •