Base | Representation |
---|---|
bin | 1100000000010110101100… |
… | …0101100110111110010111 |
3 | 1201201221002210200222202022 |
4 | 3000011223011212332113 |
5 | 3212233033132224304 |
6 | 44024034044403355 |
7 | 2531454014220644 |
oct | 300055305467627 |
9 | 51657083628668 |
10 | 13200231133079 |
11 | 422a206388671 |
12 | 159236284655b |
13 | 749a12b42513 |
14 | 338c74ab0dcb |
15 | 17d57d064ebe |
hex | c016b166f97 |
13200231133079 has 2 divisors, whose sum is σ = 13200231133080. Its totient is φ = 13200231133078.
The previous prime is 13200231132983. The next prime is 13200231133081. The reversal of 13200231133079 is 97033113200231.
13200231133079 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13200231133079 - 212 = 13200231128983 is a prime.
It is a super-2 number, since 2×132002311330792 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 13200231133081, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13200231135079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6600115566539 + 6600115566540.
It is an arithmetic number, because the mean of its divisors is an integer number (6600115566540).
Almost surely, 213200231133079 is an apocalyptic number.
13200231133079 is a deficient number, since it is larger than the sum of its proper divisors (1).
13200231133079 is an equidigital number, since it uses as much as digits as its factorization.
13200231133079 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20412, while the sum is 35.
The spelling of 13200231133079 in words is "thirteen trillion, two hundred billion, two hundred thirty-one million, one hundred thirty-three thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •