Base | Representation |
---|---|
bin | 1011111000100110010010… |
… | …0101111111110110001001 |
3 | 1201021012011011210110112202 |
4 | 2332021210211333312021 |
5 | 3203042132404244443 |
6 | 43442515323445545 |
7 | 2516025621026366 |
oct | 276114445776611 |
9 | 51235134713482 |
10 | 13066978196873 |
11 | 418874659a407 |
12 | 15705746868b5 |
13 | 73a298056483 |
14 | 33263359b46d |
15 | 179d7e8487b8 |
hex | be26497fd89 |
13066978196873 has 2 divisors, whose sum is σ = 13066978196874. Its totient is φ = 13066978196872.
The previous prime is 13066978196747. The next prime is 13066978196897. The reversal of 13066978196873 is 37869187966031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11985977153929 + 1081001042944 = 3462077^2 + 1039712^2 .
It is an emirp because it is prime and its reverse (37869187966031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13066978196873 - 222 = 13066974002569 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13066978196873.
It is not a weakly prime, because it can be changed into another prime (13066978196473) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6533489098436 + 6533489098437.
It is an arithmetic number, because the mean of its divisors is an integer number (6533489098437).
Almost surely, 213066978196873 is an apocalyptic number.
It is an amenable number.
13066978196873 is a deficient number, since it is larger than the sum of its proper divisors (1).
13066978196873 is an equidigital number, since it uses as much as digits as its factorization.
13066978196873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 493807104, while the sum is 74.
The spelling of 13066978196873 in words is "thirteen trillion, sixty-six billion, nine hundred seventy-eight million, one hundred ninety-six thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •