Base | Representation |
---|---|
bin | 1011111111100000000000… |
… | …0000000000000000000001 |
3 | 1201200112012121210202210112 |
4 | 2333320000000000000001 |
5 | 3212013001144124341 |
6 | 44013205144241105 |
7 | 2530424132226533 |
oct | 277700000000001 |
9 | 51615177722715 |
10 | 13185549598721 |
11 | 4223a620025a5 |
12 | 158b545a70195 |
13 | 74851328b196 |
14 | 338280ca9853 |
15 | 17cebe1aaaeb |
hex | bfe00000001 |
13185549598721 has 2 divisors, whose sum is σ = 13185549598722. Its totient is φ = 13185549598720.
The previous prime is 13185549598633. The next prime is 13185549598783. The reversal of 13185549598721 is 12789594558131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6835275598096 + 6350274000625 = 2614436^2 + 2519975^2 .
It is a cyclic number.
It is not a de Polignac number, because 13185549598721 - 222 = 13185545404417 is a prime.
It is not a weakly prime, because it can be changed into another prime (13185549598021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6592774799360 + 6592774799361.
It is an arithmetic number, because the mean of its divisors is an integer number (6592774799361).
It is a Proth number, since it is equal to 1535 ⋅ 233 + 1 and 1535 < 233.
Almost surely, 213185549598721 is an apocalyptic number.
It is an amenable number.
13185549598721 is a deficient number, since it is larger than the sum of its proper divisors (1).
13185549598721 is an equidigital number, since it uses as much as digits as its factorization.
13185549598721 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 108864000, while the sum is 68.
The spelling of 13185549598721 in words is "thirteen trillion, one hundred eighty-five billion, five hundred forty-nine million, five hundred ninety-eight thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •