Base | Representation |
---|---|
bin | 1010000111111011010111… |
… | …1110111010101101001111 |
3 | 1110102010212101001020212120 |
4 | 2201332311332322231033 |
5 | 2424333412214332143 |
6 | 35401353234104023 |
7 | 2226132216020541 |
oct | 241766576725517 |
9 | 43363771036776 |
10 | 11131313433423 |
11 | 3601844271007 |
12 | 12b93a641b013 |
13 | 6298a8458111 |
14 | 2a6a8925b691 |
15 | 14483e9b3383 |
hex | a1fb5fbab4f |
11131313433423 has 32 divisors (see below), whose sum is σ = 15088221496320. Its totient is φ = 7298012684160.
The previous prime is 11131313433389. The next prime is 11131313433437. The reversal of 11131313433423 is 32433431313111.
It is not a de Polignac number, because 11131313433423 - 210 = 11131313432399 is a prime.
It is a super-2 number, since 2×111313134334232 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131313533423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 835238586 + ... + 835251912.
It is an arithmetic number, because the mean of its divisors is an integer number (471506921760).
Almost surely, 211131313433423 is an apocalyptic number.
11131313433423 is a deficient number, since it is larger than the sum of its proper divisors (3956908062897).
11131313433423 is a wasteful number, since it uses less digits than its factorization.
11131313433423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19967.
The product of its digits is 23328, while the sum is 33.
Adding to 11131313433423 its reverse (32433431313111), we get a palindrome (43564744746534).
The spelling of 11131313433423 in words is "eleven trillion, one hundred thirty-one billion, three hundred thirteen million, four hundred thirty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •