Base | Representation |
---|---|
bin | 11001010110000110… |
… | …00110001111100101 |
3 | 1022010022020000222122 |
4 | 30223003012033211 |
5 | 210331411243211 |
6 | 10130120035325 |
7 | 661124506064 |
oct | 145303061745 |
9 | 38108200878 |
10 | 13607134181 |
11 | 5852966343 |
12 | 2779002b45 |
13 | 138b0c78b4 |
14 | 93124c1db |
15 | 5498cd6db |
hex | 32b0c63e5 |
13607134181 has 2 divisors, whose sum is σ = 13607134182. Its totient is φ = 13607134180.
The previous prime is 13607134147. The next prime is 13607134207. The reversal of 13607134181 is 18143170631.
13607134181 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7855276900 + 5751857281 = 88630^2 + 75841^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13607134181 is a prime.
It is a super-2 number, since 2×136071341812 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13607136181) 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, 6803567090 + 6803567091.
It is an arithmetic number, because the mean of its divisors is an integer number (6803567091).
Almost surely, 213607134181 is an apocalyptic number.
It is an amenable number.
13607134181 is a deficient number, since it is larger than the sum of its proper divisors (1).
13607134181 is an equidigital number, since it uses as much as digits as its factorization.
13607134181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 35.
The spelling of 13607134181 in words is "thirteen billion, six hundred seven million, one hundred thirty-four thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •