Base | Representation |
---|---|
bin | 1011101001000110110… |
… | …1111110000000000001 |
3 | 201010021021012110121112 |
4 | 2322101231332000001 |
5 | 11234111342223434 |
6 | 231515041533105 |
7 | 20310341336333 |
oct | 2722155760001 |
9 | 633237173545 |
10 | 200013242369 |
11 | 77909296406 |
12 | 32920044195 |
13 | 15b26ca77b5 |
14 | 9975b6b453 |
15 | 53096dcdce |
hex | 2e91b7e001 |
200013242369 has 2 divisors, whose sum is σ = 200013242370. Its totient is φ = 200013242368.
The previous prime is 200013242329. The next prime is 200013242381. The reversal of 200013242369 is 963242310002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129197113600 + 70816128769 = 359440^2 + 266113^2 .
It is a cyclic number.
It is not a de Polignac number, because 200013242369 - 220 = 200012193793 is a prime.
It is a super-2 number, since 2×2000132423692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200013242329) 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, 100006621184 + 100006621185.
It is an arithmetic number, because the mean of its divisors is an integer number (100006621185).
Almost surely, 2200013242369 is an apocalyptic number.
It is an amenable number.
200013242369 is a deficient number, since it is larger than the sum of its proper divisors (1).
200013242369 is an equidigital number, since it uses as much as digits as its factorization.
200013242369 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 32.
The spelling of 200013242369 in words is "two hundred billion, thirteen million, two hundred forty-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •