Base | Representation |
---|---|
bin | 1100000000010110101100… |
… | …0010001010100011101001 |
3 | 1201201221002202000010022011 |
4 | 3000011223002022203221 |
5 | 3212233032414331444 |
6 | 44024034013155521 |
7 | 2531454003440536 |
oct | 300055302124351 |
9 | 51657082003264 |
10 | 13200230230249 |
11 | 422a205921327 |
12 | 159236248bba1 |
13 | 749a128b75ba |
14 | 338c74917d8d |
15 | 17d57ce37734 |
hex | c016b08a8e9 |
13200230230249 has 2 divisors, whose sum is σ = 13200230230250. Its totient is φ = 13200230230248.
The previous prime is 13200230230193. The next prime is 13200230230259. The reversal of 13200230230249 is 94203203200231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9706695420249 + 3493534810000 = 3115557^2 + 1869100^2 .
It is a cyclic number.
It is not a de Polignac number, because 13200230230249 - 219 = 13200229705961 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13200230230249.
It is not a weakly prime, because it can be changed into another prime (13200230230259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6600115115124 + 6600115115125.
It is an arithmetic number, because the mean of its divisors is an integer number (6600115115125).
Almost surely, 213200230230249 is an apocalyptic number.
It is an amenable number.
13200230230249 is a deficient number, since it is larger than the sum of its proper divisors (1).
13200230230249 is an equidigital number, since it uses as much as digits as its factorization.
13200230230249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 31.
The spelling of 13200230230249 in words is "thirteen trillion, two hundred billion, two hundred thirty million, two hundred thirty thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •