Base | Representation |
---|---|
bin | 1000010100011100… |
… | …0110011100001001 |
3 | 12202122012220011110 |
4 | 2011013012130021 |
5 | 14033201343423 |
6 | 1005333520533 |
7 | 106225102611 |
oct | 20507063411 |
9 | 5678186143 |
10 | 2233231113 |
11 | a46667653 |
12 | 523aa3149 |
13 | 297898239 |
14 | 17284ba41 |
15 | d10d3193 |
hex | 851c6709 |
2233231113 has 8 divisors (see below), whose sum is σ = 2978766976. Its totient is φ = 1488258000.
The previous prime is 2233231067. The next prime is 2233231151. The reversal of 2233231113 is 3111323322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2233231113 - 225 = 2199676681 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2233231113.
It is not an unprimeable number, because it can be changed into a prime (2233231183) 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, 131338 + ... + 147363.
It is an arithmetic number, because the mean of its divisors is an integer number (372345872).
Almost surely, 22233231113 is an apocalyptic number.
It is an amenable number.
2233231113 is a deficient number, since it is larger than the sum of its proper divisors (745535863).
2233231113 is a wasteful number, since it uses less digits than its factorization.
2233231113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281375.
The product of its digits is 648, while the sum is 21.
The square root of 2233231113 is about 47257.0747401910. The cubic root of 2233231113 is about 1307.1072491770.
Adding to 2233231113 its reverse (3111323322), we get a palindrome (5344554435).
The spelling of 2233231113 in words is "two billion, two hundred thirty-three million, two hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •