Base | Representation |
---|---|
bin | 1010001011111011010100… |
… | …1110000110010011100101 |
3 | 1110122201012122210012010102 |
4 | 2202332311032012103211 |
5 | 2432000120122100423 |
6 | 35453115044433445 |
7 | 2234113640115563 |
oct | 242766516062345 |
9 | 43581178705112 |
10 | 11200020112613 |
11 | 36289a1408002 |
12 | 130a7800a8885 |
13 | 633207965987 |
14 | 2aa1261b0a33 |
15 | 1465117a2c28 |
hex | a2fb53864e5 |
11200020112613 has 2 divisors, whose sum is σ = 11200020112614. Its totient is φ = 11200020112612.
The previous prime is 11200020112601. The next prime is 11200020112621. The reversal of 11200020112613 is 31621102000211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6179987177764 + 5020032934849 = 2485958^2 + 2240543^2 .
It is a cyclic number.
It is not a de Polignac number, because 11200020112613 - 24 = 11200020112597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11200020112663) 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 as a sum of consecutive naturals, namely, 5600010056306 + 5600010056307.
It is an arithmetic number, because the mean of its divisors is an integer number (5600010056307).
Almost surely, 211200020112613 is an apocalyptic number.
It is an amenable number.
11200020112613 is a deficient number, since it is larger than the sum of its proper divisors (1).
11200020112613 is an equidigital number, since it uses as much as digits as its factorization.
11200020112613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11200020112613 its reverse (31621102000211), we get a palindrome (42821122112824).
The spelling of 11200020112613 in words is "eleven trillion, two hundred billion, twenty million, one hundred twelve thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •