Base | Representation |
---|---|
bin | 1100010001100001000101… |
… | …1101110011111100010001 |
3 | 1202210010011100101010221021 |
4 | 3010120101131303330101 |
5 | 3232100411022143013 |
6 | 44411315420555441 |
7 | 2561662445440462 |
oct | 304302135637421 |
9 | 52703140333837 |
10 | 13495080271633 |
11 | 433325aaa7484 |
12 | 161b52b0b2b81 |
13 | 76b7717a14cc |
14 | 349245ac0d69 |
15 | 18608841ca8d |
hex | c4611773f11 |
13495080271633 has 2 divisors, whose sum is σ = 13495080271634. Its totient is φ = 13495080271632.
The previous prime is 13495080271627. The next prime is 13495080271681. The reversal of 13495080271633 is 33617208059431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12674048563969 + 821031707664 = 3560063^2 + 906108^2 .
It is an emirp because it is prime and its reverse (33617208059431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13495080271633 is a prime.
It is not a weakly prime, because it can be changed into another prime (13495080271613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6747540135816 + 6747540135817.
It is an arithmetic number, because the mean of its divisors is an integer number (6747540135817).
It is a 1-persistent number, because it is pandigital, but 2⋅13495080271633 = 26990160543266 is not.
Almost surely, 213495080271633 is an apocalyptic number.
It is an amenable number.
13495080271633 is a deficient number, since it is larger than the sum of its proper divisors (1).
13495080271633 is an equidigital number, since it uses as much as digits as its factorization.
13495080271633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3265920, while the sum is 52.
The spelling of 13495080271633 in words is "thirteen trillion, four hundred ninety-five billion, eighty million, two hundred seventy-one thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •