Base | Representation |
---|---|
bin | 1011111110100100010111… |
… | …1100001110001000111001 |
3 | 1201121222220002211121202221 |
4 | 2333221011330032020321 |
5 | 3211232211021101433 |
6 | 44002000554324041 |
7 | 2526316361504005 |
oct | 277510574161071 |
9 | 51558802747687 |
10 | 13169543143993 |
11 | 4218198859215 |
12 | 1588419429621 |
13 | 746b62084cb2 |
14 | 3375a3137705 |
15 | 17c883d3c72d |
hex | bfa45f0e239 |
13169543143993 has 2 divisors, whose sum is σ = 13169543143994. Its totient is φ = 13169543143992.
The previous prime is 13169543143931. The next prime is 13169543144077. The reversal of 13169543143993 is 39934134596131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11789698233769 + 1379844910224 = 3433613^2 + 1174668^2 .
It is an emirp because it is prime and its reverse (39934134596131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13169543143993 - 233 = 13160953209401 is a prime.
It is a super-2 number, since 2×131695431439932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13169543143793) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6584771571996 + 6584771571997.
It is an arithmetic number, because the mean of its divisors is an integer number (6584771571997).
Almost surely, 213169543143993 is an apocalyptic number.
It is an amenable number.
13169543143993 is a deficient number, since it is larger than the sum of its proper divisors (1).
13169543143993 is an equidigital number, since it uses as much as digits as its factorization.
13169543143993 is an evil number, because the sum of its binary digits is even.
The product of its digits is 28343520, while the sum is 61.
The spelling of 13169543143993 in words is "thirteen trillion, one hundred sixty-nine billion, five hundred forty-three million, one hundred forty-three thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •