Base | Representation |
---|---|
bin | 1011101001100101111… |
… | …0100010010010100001 |
3 | 201010121100010220010002 |
4 | 2322121132202102201 |
5 | 11234343203230213 |
6 | 231540011545345 |
7 | 20313511644614 |
oct | 2723136422241 |
9 | 633540126102 |
10 | 200143414433 |
11 | 77975815626 |
12 | 3295775b255 |
13 | 15b47c536a1 |
14 | 998917417b |
15 | 5315d52658 |
hex | 2e997a24a1 |
200143414433 has 2 divisors, whose sum is σ = 200143414434. Its totient is φ = 200143414432.
The previous prime is 200143414417. The next prime is 200143414453. The reversal of 200143414433 is 334414341002.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 182403305569 + 17740108864 = 427087^2 + 133192^2 .
It is a cyclic number.
It is not a de Polignac number, because 200143414433 - 24 = 200143414417 is a prime.
It is a super-2 number, since 2×2001434144332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200143414396 and 200143414405.
It is not a weakly prime, because it can be changed into another prime (200143414453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100071707216 + 100071707217.
It is an arithmetic number, because the mean of its divisors is an integer number (100071707217).
Almost surely, 2200143414433 is an apocalyptic number.
It is an amenable number.
200143414433 is a deficient number, since it is larger than the sum of its proper divisors (1).
200143414433 is an equidigital number, since it uses as much as digits as its factorization.
200143414433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 200143414433 its reverse (334414341002), we get a palindrome (534557755435).
The spelling of 200143414433 in words is "two hundred billion, one hundred forty-three million, four hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •