Base | Representation |
---|---|
bin | 1100010001011101110011… |
… | …0100010110111111110001 |
3 | 1202210000212210022210020101 |
4 | 3010113130310112333301 |
5 | 3232042103412134222 |
6 | 44411052025112401 |
7 | 2561631531612256 |
oct | 304273464267761 |
9 | 52700783283211 |
10 | 13494196989937 |
11 | 4332947453904 |
12 | 161b323328701 |
13 | 76b6607ac611 |
14 | 3491a067742d |
15 | 186035ae4927 |
hex | c45dcd16ff1 |
13494196989937 has 2 divisors, whose sum is σ = 13494196989938. Its totient is φ = 13494196989936.
The previous prime is 13494196989913. The next prime is 13494196989961. The reversal of 13494196989937 is 73998969149431.
It is a balanced prime because it is at equal distance from previous prime (13494196989913) and next prime (13494196989961).
It can be written as a sum of positive squares in only one way, i.e., 13150602893376 + 343594096561 = 3626376^2 + 586169^2 .
It is an emirp because it is prime and its reverse (73998969149431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13494196989937 - 219 = 13494196465649 is a prime.
It is not a weakly prime, because it can be changed into another prime (13494196989997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6747098494968 + 6747098494969.
It is an arithmetic number, because the mean of its divisors is an integer number (6747098494969).
Almost surely, 213494196989937 is an apocalyptic number.
It is an amenable number.
13494196989937 is a deficient number, since it is larger than the sum of its proper divisors (1).
13494196989937 is an equidigital number, since it uses as much as digits as its factorization.
13494196989937 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2857026816, while the sum is 82.
The spelling of 13494196989937 in words is "thirteen trillion, four hundred ninety-four billion, one hundred ninety-six million, nine hundred eighty-nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •