Base | Representation |
---|---|
bin | 1010101001000111001010… |
… | …1000111000111000100001 |
3 | 1112102122101200021200200122 |
4 | 2222101302220320320201 |
5 | 3013203444021020211 |
6 | 40515315552530025 |
7 | 2315253644623052 |
oct | 252216250707041 |
9 | 45378350250618 |
10 | 11701414235681 |
11 | 38015a630a825 |
12 | 138b98bb50915 |
13 | 66b591885231 |
14 | 2c64cc616729 |
15 | 1545a99b96db |
hex | aa472a38e21 |
11701414235681 has 2 divisors, whose sum is σ = 11701414235682. Its totient is φ = 11701414235680.
The previous prime is 11701414235647. The next prime is 11701414235713. The reversal of 11701414235681 is 18653241410711.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11521136718400 + 180277517281 = 3394280^2 + 424591^2 .
It is a cyclic number.
It is not a de Polignac number, because 11701414235681 - 226 = 11701347126817 is a prime.
It is a super-2 number, since 2×117014142356812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11701414255681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5850707117840 + 5850707117841.
It is an arithmetic number, because the mean of its divisors is an integer number (5850707117841).
Almost surely, 211701414235681 is an apocalyptic number.
It is an amenable number.
11701414235681 is a deficient number, since it is larger than the sum of its proper divisors (1).
11701414235681 is an equidigital number, since it uses as much as digits as its factorization.
11701414235681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 161280, while the sum is 44.
The spelling of 11701414235681 in words is "eleven trillion, seven hundred one billion, four hundred fourteen million, two hundred thirty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •