Base | Representation |
---|---|
bin | 101101011110110100100011… |
… | …101101111100011010100111 |
3 | 222020020200200101000121012022 |
4 | 231132310203231330122213 |
5 | 202204243131421414421 |
6 | 1545232321531213355 |
7 | 60063461424533453 |
oct | 5536644355743247 |
9 | 866220611017168 |
10 | 200030111123111 |
11 | 58810325a55865 |
12 | 1a5272135a725b |
13 | 877c9b26905a9 |
14 | 375771ab17663 |
15 | 181d3978187ab |
hex | b5ed23b7c6a7 |
200030111123111 has 2 divisors, whose sum is σ = 200030111123112. Its totient is φ = 200030111123110.
The previous prime is 200030111123107. The next prime is 200030111123137. The reversal of 200030111123111 is 111321111030002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200030111123111 - 22 = 200030111123107 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200030111123111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200030111123191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100015055561555 + 100015055561556.
It is an arithmetic number, because the mean of its divisors is an integer number (100015055561556).
Almost surely, 2200030111123111 is an apocalyptic number.
200030111123111 is a deficient number, since it is larger than the sum of its proper divisors (1).
200030111123111 is an equidigital number, since it uses as much as digits as its factorization.
200030111123111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 200030111123111 its reverse (111321111030002), we get a palindrome (311351222153113).
The spelling of 200030111123111 in words is "two hundred trillion, thirty billion, one hundred eleven million, one hundred twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •