Base | Representation |
---|---|
bin | 10100101101110000… |
… | …01000110110101011 |
3 | 1001201001120012002111 |
4 | 22112320020312223 |
5 | 140234013431243 |
6 | 5035314343151 |
7 | 542410631524 |
oct | 122670106653 |
9 | 31631505074 |
10 | 11121233323 |
11 | 4797712222 |
12 | 21a458aab7 |
13 | 1083093a45 |
14 | 77702b84b |
15 | 45153a39d |
hex | 296e08dab |
11121233323 has 12 divisors (see below), whose sum is σ = 11390634720. Its totient is φ = 10854148032.
The previous prime is 11121233303. The next prime is 11121233359. The reversal of 11121233323 is 32333212111.
11121233323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-11121233323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11121233294 and 11121233303.
It is not an unprimeable number, because it can be changed into a prime (11121233303) 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 11 ways as a sum of consecutive naturals, for example, 11868511 + ... + 11869447.
It is an arithmetic number, because the mean of its divisors is an integer number (949219560).
Almost surely, 211121233323 is an apocalyptic number.
11121233323 is a deficient number, since it is larger than the sum of its proper divisors (269401397).
11121233323 is an frugal number, since it uses more digits than its factorization.
11121233323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2166 (or 1229 counting only the distinct ones).
The product of its digits is 648, while the sum is 22.
Adding to 11121233323 its reverse (32333212111), we get a palindrome (43454445434).
The spelling of 11121233323 in words is "eleven billion, one hundred twenty-one million, two hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •