Base | Representation |
---|---|
bin | 1010011101001100111011… |
… | …0111011110001001000001 |
3 | 1111201002020222101200001021 |
4 | 2213103032313132021001 |
5 | 3001330423100210334 |
6 | 40241320342505441 |
7 | 2264421333136021 |
oct | 247231667361101 |
9 | 44632228350037 |
10 | 11496803131969 |
11 | 3732848713111 |
12 | 13581a8135281 |
13 | 6551b415ba2c |
14 | 2ba63bd87a81 |
15 | 14e0d180c3b4 |
hex | a74cedde241 |
11496803131969 has 2 divisors, whose sum is σ = 11496803131970. Its totient is φ = 11496803131968.
The previous prime is 11496803131897. The next prime is 11496803131993. The reversal of 11496803131969 is 96913130869411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10558190939569 + 938612192400 = 3249337^2 + 968820^2 .
It is a cyclic number.
It is not a de Polignac number, because 11496803131969 - 27 = 11496803131841 is a prime.
It is a super-2 number, since 2×114968031319692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11496803131069) 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, 5748401565984 + 5748401565985.
It is an arithmetic number, because the mean of its divisors is an integer number (5748401565985).
Almost surely, 211496803131969 is an apocalyptic number.
It is an amenable number.
11496803131969 is a deficient number, since it is larger than the sum of its proper divisors (1).
11496803131969 is an equidigital number, since it uses as much as digits as its factorization.
11496803131969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7558272, while the sum is 61.
The spelling of 11496803131969 in words is "eleven trillion, four hundred ninety-six billion, eight hundred three million, one hundred thirty-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •