Base | Representation |
---|---|
bin | 1011110111111110010101… |
… | …1100001000000010111101 |
3 | 1201020011110212010222220201 |
4 | 2331333211130020002331 |
5 | 3202403202232433442 |
6 | 43433543303443501 |
7 | 2515166112055423 |
oct | 275774534100275 |
9 | 51204425128821 |
10 | 13056254967997 |
11 | 418414360a88a |
12 | 156a481456591 |
13 | 739279585927 |
14 | 331cd7375113 |
15 | 17995322a7b7 |
hex | bdfe57080bd |
13056254967997 has 2 divisors, whose sum is σ = 13056254967998. Its totient is φ = 13056254967996.
The previous prime is 13056254967983. The next prime is 13056254968051. The reversal of 13056254967997 is 79976945265031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12155082579396 + 901172388601 = 3486414^2 + 949301^2 .
It is a cyclic number.
It is not a de Polignac number, because 13056254967997 - 231 = 13054107484349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13056254967937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6528127483998 + 6528127483999.
It is an arithmetic number, because the mean of its divisors is an integer number (6528127483999).
Almost surely, 213056254967997 is an apocalyptic number.
It is an amenable number.
13056254967997 is a deficient number, since it is larger than the sum of its proper divisors (1).
13056254967997 is an equidigital number, since it uses as much as digits as its factorization.
13056254967997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 771573600, while the sum is 73.
The spelling of 13056254967997 in words is "thirteen trillion, fifty-six billion, two hundred fifty-four million, nine hundred sixty-seven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •