Base | Representation |
---|---|
bin | 1100000110110100000101… |
… | …0110011001100111000001 |
3 | 1202010112112102021121111002 |
4 | 3001231001112121213001 |
5 | 3221042314202311114 |
6 | 44151025245301345 |
7 | 2542462642326014 |
oct | 301550126314701 |
9 | 52115472247432 |
10 | 13311200041409 |
11 | 4272280445966 |
12 | 15ab971b64855 |
13 | 757318cb175a |
14 | 3403a082b37b |
15 | 1813c524b7de |
hex | c1b415999c1 |
13311200041409 has 2 divisors, whose sum is σ = 13311200041410. Its totient is φ = 13311200041408.
The previous prime is 13311200041369. The next prime is 13311200041417. The reversal of 13311200041409 is 90414000211331.
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., 12218240611600 + 1092959429809 = 3495460^2 + 1045447^2 .
It is an emirp because it is prime and its reverse (90414000211331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13311200041409 - 216 = 13311199975873 is a prime.
It is not a weakly prime, because it can be changed into another prime (13311200041429) 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, 6655600020704 + 6655600020705.
It is an arithmetic number, because the mean of its divisors is an integer number (6655600020705).
Almost surely, 213311200041409 is an apocalyptic number.
It is an amenable number.
13311200041409 is a deficient number, since it is larger than the sum of its proper divisors (1).
13311200041409 is an equidigital number, since it uses as much as digits as its factorization.
13311200041409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 13311200041409 in words is "thirteen trillion, three hundred eleven billion, two hundred million, forty-one thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •