Base | Representation |
---|---|
bin | 1010000110001011010011… |
… | …1111101111111111110101 |
3 | 1110022021012221201100200212 |
4 | 2201202310333233333311 |
5 | 2423340310404302123 |
6 | 35335500254515205 |
7 | 2224015610646134 |
oct | 241426477577765 |
9 | 43267187640625 |
10 | 11101232103413 |
11 | 35a00081285a1 |
12 | 12b35b0205b05 |
13 | 626ac328846a |
14 | 2a54340c191b |
15 | 143b7db71878 |
hex | a18b4fefff5 |
11101232103413 has 2 divisors, whose sum is σ = 11101232103414. Its totient is φ = 11101232103412.
The previous prime is 11101232103343. The next prime is 11101232103419. The reversal of 11101232103413 is 31430123210111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5637428702929 + 5463803400484 = 2374327^2 + 2337478^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101232103413 - 218 = 11101231841269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101232103419) 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 as a sum of consecutive naturals, namely, 5550616051706 + 5550616051707.
It is an arithmetic number, because the mean of its divisors is an integer number (5550616051707).
Almost surely, 211101232103413 is an apocalyptic number.
It is an amenable number.
11101232103413 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101232103413 is an equidigital number, since it uses as much as digits as its factorization.
11101232103413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11101232103413 its reverse (31430123210111), we get a palindrome (42531355313524).
The spelling of 11101232103413 in words is "eleven trillion, one hundred one billion, two hundred thirty-two million, one hundred three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •