Base | Representation |
---|---|
bin | 10100101100110011… |
… | …00111001100010011 |
3 | 1001200111111122010201 |
4 | 22112121213030103 |
5 | 140224441343443 |
6 | 5034431040031 |
7 | 542252622511 |
oct | 122631471423 |
9 | 31614448121 |
10 | 11113231123 |
11 | 4793147035 |
12 | 21a1970017 |
13 | 1081521607 |
14 | 775d474b1 |
15 | 4509a934d |
hex | 296667313 |
11113231123 has 2 divisors, whose sum is σ = 11113231124. Its totient is φ = 11113231122.
The previous prime is 11113231099. The next prime is 11113231189. The reversal of 11113231123 is 32113231111.
11113231123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11113231123 - 225 = 11079676691 is a prime.
It is a super-2 number, since 2×111132311232 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11113231123.
It is not a weakly prime, because it can be changed into another prime (11113235123) 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 as a sum of consecutive naturals, namely, 5556615561 + 5556615562.
It is an arithmetic number, because the mean of its divisors is an integer number (5556615562).
Almost surely, 211113231123 is an apocalyptic number.
11113231123 is a deficient number, since it is larger than the sum of its proper divisors (1).
11113231123 is an equidigital number, since it uses as much as digits as its factorization.
11113231123 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 108, while the sum is 19.
Adding to 11113231123 its reverse (32113231111), we get a palindrome (43226462234).
The spelling of 11113231123 in words is "eleven billion, one hundred thirteen million, two hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •