Base | Representation |
---|---|
bin | 10100101101110000… |
… | …01101101111010011 |
3 | 1001201001121012112112 |
4 | 22112320031233103 |
5 | 140234020101311 |
6 | 5035315015535 |
7 | 542411044046 |
oct | 122670155723 |
9 | 31631535475 |
10 | 11121253331 |
11 | 4797726261 |
12 | 21a459a5ab |
13 | 108309cb96 |
14 | 777034c5d |
15 | 45154128b |
hex | 296e0dbd3 |
11121253331 has 4 divisors (see below), whose sum is σ = 11126118432. Its totient is φ = 11116388232.
The previous prime is 11121253313. The next prime is 11121253397. The reversal of 11121253331 is 13335212111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11121253331 - 26 = 11121253267 is a prime.
It is a super-2 number, since 2×111212533312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11121253297 and 11121253306.
It is not an unprimeable number, because it can be changed into a prime (11121253301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2429120 + ... + 2433693.
It is an arithmetic number, because the mean of its divisors is an integer number (2781529608).
Almost surely, 211121253331 is an apocalyptic number.
11121253331 is a deficient number, since it is larger than the sum of its proper divisors (4865101).
11121253331 is an equidigital number, since it uses as much as digits as its factorization.
11121253331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4865100.
The product of its digits is 540, while the sum is 23.
Adding to 11121253331 its reverse (13335212111), we get a palindrome (24456465442).
The spelling of 11121253331 in words is "eleven billion, one hundred twenty-one million, two hundred fifty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •