Base | Representation |
---|---|
bin | 1010011001011000001111… |
… | …1011001101100101110001 |
3 | 1111110210201111110111201121 |
4 | 2212112003323031211301 |
5 | 2444241414023441423 |
6 | 40151215025302241 |
7 | 2256604561651606 |
oct | 246260373154561 |
9 | 44423644414647 |
10 | 11431121312113 |
11 | 3707a02a76768 |
12 | 1347517494981 |
13 | 64bc4752a879 |
14 | 2b73aaa6c6ad |
15 | 14c53a37245d |
hex | a6583ecd971 |
11431121312113 has 8 divisors (see below), whose sum is σ = 11570639682528. Its totient is φ = 11292208228224.
The previous prime is 11431121312111. The next prime is 11431121312137. The reversal of 11431121312113 is 31121312113411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11431121312113 - 21 = 11431121312111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11431121312111) 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, 151283631 + ... + 151359172.
It is an arithmetic number, because the mean of its divisors is an integer number (1446329960316).
Almost surely, 211431121312113 is an apocalyptic number.
It is an amenable number.
11431121312113 is a deficient number, since it is larger than the sum of its proper divisors (139518370415).
11431121312113 is a wasteful number, since it uses less digits than its factorization.
11431121312113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302643263.
The product of its digits is 432, while the sum is 25.
Adding to 11431121312113 its reverse (31121312113411), we get a palindrome (42552433425524).
The spelling of 11431121312113 in words is "eleven trillion, four hundred thirty-one billion, one hundred twenty-one million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •