Base | Representation |
---|---|
bin | 10100101101110110… |
… | …01001101101000001 |
3 | 1001201010001022122102 |
4 | 22112323021231001 |
5 | 140234214220413 |
6 | 5035343320145 |
7 | 542420431466 |
oct | 122673115501 |
9 | 31633038572 |
10 | 11122023233 |
11 | 4798101742 |
12 | 21a48b0055 |
13 | 10832ac449 |
14 | 77719566d |
15 | 451644458 |
hex | 296ec9b41 |
11122023233 has 8 divisors (see below), whose sum is σ = 11556834816. Its totient is φ = 10691964000.
The previous prime is 11122023193. The next prime is 11122023257. The reversal of 11122023233 is 33232022111.
11122023233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11122023233 - 228 = 10853587777 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11122026233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1183316 + ... + 1192677.
It is an arithmetic number, because the mean of its divisors is an integer number (1444604352).
Almost surely, 211122023233 is an apocalyptic number.
It is an amenable number.
11122023233 is a deficient number, since it is larger than the sum of its proper divisors (434811583).
11122023233 is a wasteful number, since it uses less digits than its factorization.
11122023233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2376175.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 11122023233 its reverse (33232022111), we get a palindrome (44354045344).
The spelling of 11122023233 in words is "eleven billion, one hundred twenty-two million, twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •