Base | Representation |
---|---|
bin | 1100001001001101111011… |
… | …1000010110010111010111 |
3 | 1202021111010112001111012121 |
4 | 3002103132320112113113 |
5 | 3222231403400411331 |
6 | 44222015221000411 |
7 | 2545454224351243 |
oct | 302233670262727 |
9 | 52244115044177 |
10 | 13352497669591 |
11 | 4288842921193 |
12 | 15b7978553107 |
13 | 75b19ab4b532 |
14 | 34239b49d423 |
15 | 1824e0b05c11 |
hex | c24dee165d7 |
13352497669591 has 2 divisors, whose sum is σ = 13352497669592. Its totient is φ = 13352497669590.
The previous prime is 13352497669513. The next prime is 13352497669661. The reversal of 13352497669591 is 19596679425331.
It is an a-pointer prime, because the next prime (13352497669661) can be obtained adding 13352497669591 to its sum of digits (70).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13352497669591 - 223 = 13352489280983 is a prime.
It is a super-2 number, since 2×133524976695912 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13352497669591.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13352497667591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6676248834795 + 6676248834796.
It is an arithmetic number, because the mean of its divisors is an integer number (6676248834796).
Almost surely, 213352497669591 is an apocalyptic number.
13352497669591 is a deficient number, since it is larger than the sum of its proper divisors (1).
13352497669591 is an equidigital number, since it uses as much as digits as its factorization.
13352497669591 is an evil number, because the sum of its binary digits is even.
The product of its digits is 330674400, while the sum is 70.
The spelling of 13352497669591 in words is "thirteen trillion, three hundred fifty-two billion, four hundred ninety-seven million, six hundred sixty-nine thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •