Base | Representation |
---|---|
bin | 1010010011100011010011… |
… | …1101011000100001011111 |
3 | 1111010020022201120101111021 |
4 | 2210320310331120201133 |
5 | 2441121403112431221 |
6 | 40033221204305011 |
7 | 2246432021556241 |
oct | 244706475304137 |
9 | 44106281511437 |
10 | 11331012233311 |
11 | 36795010090a1 |
12 | 13300390a2167 |
13 | 642682249174 |
14 | 2b25d1336091 |
15 | 149b2b78d041 |
hex | a4e34f5885f |
11331012233311 has 4 divisors (see below), whose sum is σ = 11378028881824. Its totient is φ = 11283995584800.
The previous prime is 11331012233297. The next prime is 11331012233413. The reversal of 11331012233311 is 11333221013311.
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 11331012233311 - 217 = 11331012102239 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331012243311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23508323895 + ... + 23508324376.
It is an arithmetic number, because the mean of its divisors is an integer number (2844507220456).
Almost surely, 211331012233311 is an apocalyptic number.
11331012233311 is a deficient number, since it is larger than the sum of its proper divisors (47016648513).
11331012233311 is an equidigital number, since it uses as much as digits as its factorization.
11331012233311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47016648512.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 11331012233311 its reverse (11333221013311), we get a palindrome (22664233246622).
The spelling of 11331012233311 in words is "eleven trillion, three hundred thirty-one billion, twelve million, two hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •