Base | Representation |
---|---|
bin | 100001101101100010… |
… | …100011001100110101 |
3 | 10110102200000010120012 |
4 | 201231202203030311 |
5 | 1043113030340424 |
6 | 24343502150005 |
7 | 2421002526632 |
oct | 415542431465 |
9 | 113380003505 |
10 | 36197511989 |
11 | 14395608571 |
12 | 7022582305 |
13 | 354b356862 |
14 | 1a7558d189 |
15 | e1cc78b0e |
hex | 86d8a3335 |
36197511989 has 2 divisors, whose sum is σ = 36197511990. Its totient is φ = 36197511988.
The previous prime is 36197511983. The next prime is 36197512037. The reversal of 36197511989 is 98911579163.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21229947025 + 14967564964 = 145705^2 + 122342^2 .
It is an emirp because it is prime and its reverse (98911579163) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-36197511989 is a prime.
It is a super-2 number, since 2×361975119892 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (36197511983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 18098755994 + 18098755995.
It is an arithmetic number, because the mean of its divisors is an integer number (18098755995).
Almost surely, 236197511989 is an apocalyptic number.
It is an amenable number.
36197511989 is a deficient number, since it is larger than the sum of its proper divisors (1).
36197511989 is an equidigital number, since it uses as much as digits as its factorization.
36197511989 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3674160, while the sum is 59.
The spelling of 36197511989 in words is "thirty-six billion, one hundred ninety-seven million, five hundred eleven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •