Base | Representation |
---|---|
bin | 1010000110110111100100… |
… | …0011010111111000010101 |
3 | 1110100101212211120012021120 |
4 | 2201231321003113320111 |
5 | 2424034122444302013 |
6 | 35345143131434153 |
7 | 2224616154435642 |
oct | 241557103277025 |
9 | 43311784505246 |
10 | 11113111322133 |
11 | 35a5053694427 |
12 | 12b59665b5959 |
13 | 627c673b1572 |
14 | 2a5c3da5cdc9 |
15 | 1441269d5123 |
hex | a1b790d7e15 |
11113111322133 has 8 divisors (see below), whose sum is σ = 14843523033600. Its totient is φ = 7395720246048.
The previous prime is 11113111322113. The next prime is 11113111322177. The reversal of 11113111322133 is 33122311131111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11113111322133 - 236 = 11044391845397 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11113111322113) 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 7 ways as a sum of consecutive naturals, for example, 3255156853 + ... + 3255160266.
It is an arithmetic number, because the mean of its divisors is an integer number (1855440379200).
Almost surely, 211113111322133 is an apocalyptic number.
It is an amenable number.
11113111322133 is a deficient number, since it is larger than the sum of its proper divisors (3730411711467).
11113111322133 is an equidigital number, since it uses as much as digits as its factorization.
11113111322133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6510317691.
The product of its digits is 324, while the sum is 24.
Adding to 11113111322133 its reverse (33122311131111), we get a palindrome (44235422453244).
The spelling of 11113111322133 in words is "eleven trillion, one hundred thirteen billion, one hundred eleven million, three hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •