Base | Representation |
---|---|
bin | 1011101010001110101… |
… | …0100100110000100001 |
3 | 201011001020202221020202 |
4 | 2322203222210300201 |
5 | 11240220432424213 |
6 | 232004555314545 |
7 | 20320655550152 |
oct | 2724352446041 |
9 | 634036687222 |
10 | 200314342433 |
11 | 77a53251337 |
12 | 329a4a4ba55 |
13 | 15b7449c20a |
14 | 99a3b49929 |
15 | 5325d67b58 |
hex | 2ea3aa4c21 |
200314342433 has 2 divisors, whose sum is σ = 200314342434. Its totient is φ = 200314342432.
The previous prime is 200314342369. The next prime is 200314342453. The reversal of 200314342433 is 334243413002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122008394209 + 78305948224 = 349297^2 + 279832^2 .
It is a cyclic number.
It is not a de Polignac number, because 200314342433 - 26 = 200314342369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200314342396 and 200314342405.
It is not a weakly prime, because it can be changed into another prime (200314342453) 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, 100157171216 + 100157171217.
It is an arithmetic number, because the mean of its divisors is an integer number (100157171217).
Almost surely, 2200314342433 is an apocalyptic number.
It is an amenable number.
200314342433 is a deficient number, since it is larger than the sum of its proper divisors (1).
200314342433 is an equidigital number, since it uses as much as digits as its factorization.
200314342433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 29.
Adding to 200314342433 its reverse (334243413002), we get a palindrome (534557755435).
The spelling of 200314342433 in words is "two hundred billion, three hundred fourteen million, three hundred forty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •