Base | Representation |
---|---|
bin | 1100000101111101110111… |
… | …1000111100000000010001 |
3 | 1202002010222011011200000122 |
4 | 3001133131320330000101 |
5 | 3220323012444043242 |
6 | 44140221200000025 |
7 | 2541436203120431 |
oct | 301373570740021 |
9 | 52063864150018 |
10 | 13296646471697 |
11 | 42670923215a6 |
12 | 15a8b90000015 |
13 | 755b39ab2644 |
14 | 33d7bda162c1 |
15 | 180d2271cad2 |
hex | c17dde3c011 |
13296646471697 has 2 divisors, whose sum is σ = 13296646471698. Its totient is φ = 13296646471696.
The previous prime is 13296646471649. The next prime is 13296646471711. The reversal of 13296646471697 is 79617464669231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11528360878336 + 1768285593361 = 3395344^2 + 1329769^2 .
It is a cyclic number.
It is not a de Polignac number, because 13296646471697 - 232 = 13292351504401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13296646471697.
It is not a weakly prime, because it can be changed into another prime (13296646471597) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6648323235848 + 6648323235849.
It is an arithmetic number, because the mean of its divisors is an integer number (6648323235849).
Almost surely, 213296646471697 is an apocalyptic number.
It is an amenable number.
13296646471697 is a deficient number, since it is larger than the sum of its proper divisors (1).
13296646471697 is an equidigital number, since it uses as much as digits as its factorization.
13296646471697 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 493807104, while the sum is 71.
The spelling of 13296646471697 in words is "thirteen trillion, two hundred ninety-six billion, six hundred forty-six million, four hundred seventy-one thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •