Base | Representation |
---|---|
bin | 10101000101100110… |
… | …00100111110110011 |
3 | 1002012222220020112012 |
4 | 22202303010332303 |
5 | 141141213431311 |
6 | 5111221153135 |
7 | 550356616112 |
oct | 124263047663 |
9 | 32188806465 |
10 | 11321233331 |
11 | 488a5a5191 |
12 | 223b55b7ab |
13 | 10b564b045 |
14 | 79580dc79 |
15 | 463d9478b |
hex | 2a2cc4fb3 |
11321233331 has 4 divisors (see below), whose sum is σ = 11322089064. Its totient is φ = 11320377600.
The previous prime is 11321233289. The next prime is 11321233337. The reversal of 11321233331 is 13333212311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13333212311 = 61 ⋅218577251.
It is a cyclic number.
It is not a de Polignac number, because 11321233331 - 218 = 11320971187 is a prime.
It is a super-2 number, since 2×113212333312 (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 = 11321233297 and 11321233306.
It is not an unprimeable number, because it can be changed into a prime (11321233337) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 407705 + ... + 434586.
It is an arithmetic number, because the mean of its divisors is an integer number (2830522266).
Almost surely, 211321233331 is an apocalyptic number.
11321233331 is a deficient number, since it is larger than the sum of its proper divisors (855733).
11321233331 is an equidigital number, since it uses as much as digits as its factorization.
11321233331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 855732.
The product of its digits is 972, while the sum is 23.
Adding to 11321233331 its reverse (13333212311), we get a palindrome (24654445642).
The spelling of 11321233331 in words is "eleven billion, three hundred twenty-one million, two hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •