Base | Representation |
---|---|
bin | 1100000000010110111111… |
… | …1110011001010001000111 |
3 | 1201201221022111222202122111 |
4 | 3000011233332121101013 |
5 | 3212233220130044012 |
6 | 44024050134041451 |
7 | 2531456031163135 |
oct | 300055776312107 |
9 | 51657274882574 |
10 | 13200313128007 |
11 | 422a2486a1675 |
12 | 15923861a9287 |
13 | 749a26b20925 |
14 | 338c81936755 |
15 | 17d58535eba7 |
hex | c016ff99447 |
13200313128007 has 2 divisors, whose sum is σ = 13200313128008. Its totient is φ = 13200313128006.
The previous prime is 13200313127983. The next prime is 13200313128017. The reversal of 13200313128007 is 70082131300231.
13200313128007 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 13200313128007 - 215 = 13200313095239 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13200313128007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13200313128017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6600156564003 + 6600156564004.
It is an arithmetic number, because the mean of its divisors is an integer number (6600156564004).
Almost surely, 213200313128007 is an apocalyptic number.
13200313128007 is a deficient number, since it is larger than the sum of its proper divisors (1).
13200313128007 is an equidigital number, since it uses as much as digits as its factorization.
13200313128007 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6048, while the sum is 31.
Adding to 13200313128007 its reverse (70082131300231), we get a palindrome (83282444428238).
The spelling of 13200313128007 in words is "thirteen trillion, two hundred billion, three hundred thirteen million, one hundred twenty-eight thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •