Base | Representation |
---|---|
bin | 1011101001101000000… |
… | …0111110101000110011 |
3 | 201010121222010121120212 |
4 | 2322122000332220303 |
5 | 11234403011142233 |
6 | 231540533254335 |
7 | 20313651461351 |
oct | 2723200765063 |
9 | 633558117525 |
10 | 200152443443 |
11 | 7797a922217 |
12 | 3295a7943ab |
13 | 15b49a952b4 |
14 | 998a4447d1 |
15 | 5316a37a48 |
hex | 2e9a03ea33 |
200152443443 has 2 divisors, whose sum is σ = 200152443444. Its totient is φ = 200152443442.
The previous prime is 200152443391. The next prime is 200152443457. The reversal of 200152443443 is 344344251002.
200152443443 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 200152443443 - 216 = 200152377907 is a prime.
It is a super-2 number, since 2×2001524434432 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (200152449443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100076221721 + 100076221722.
It is an arithmetic number, because the mean of its divisors is an integer number (100076221722).
Almost surely, 2200152443443 is an apocalyptic number.
200152443443 is a deficient number, since it is larger than the sum of its proper divisors (1).
200152443443 is an equidigital number, since it uses as much as digits as its factorization.
200152443443 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46080, while the sum is 32.
Adding to 200152443443 its reverse (344344251002), we get a palindrome (544496694445).
The spelling of 200152443443 in words is "two hundred billion, one hundred fifty-two million, four hundred forty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •