Base | Representation |
---|---|
bin | 1010000110001010110110… |
… | …1110000010101110010101 |
3 | 1110022020220102222221010111 |
4 | 2201202231232002232111 |
5 | 2423340033131133023 |
6 | 35335440214123021 |
7 | 2224012566162565 |
oct | 241425556025625 |
9 | 43266812887114 |
10 | 11101110021013 |
11 | 359aa55224251 |
12 | 12b3577350471 |
13 | 626aa3bb275c |
14 | 2a5421bc2da5 |
15 | 143b730a900d |
hex | a18adb82b95 |
11101110021013 has 2 divisors, whose sum is σ = 11101110021014. Its totient is φ = 11101110021012.
The previous prime is 11101110020993. The next prime is 11101110021037. The reversal of 11101110021013 is 31012001110111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10661485327249 + 439624693764 = 3265193^2 + 663042^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101110021013 - 213 = 11101110012821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101110020984 and 11101110021002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101110025013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550555010506 + 5550555010507.
It is an arithmetic number, because the mean of its divisors is an integer number (5550555010507).
Almost surely, 211101110021013 is an apocalyptic number.
It is an amenable number.
11101110021013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101110021013 is an equidigital number, since it uses as much as digits as its factorization.
11101110021013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 11101110021013 its reverse (31012001110111), we get a palindrome (42113111131124).
The spelling of 11101110021013 in words is "eleven trillion, one hundred one billion, one hundred ten million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •