Base | Representation |
---|---|
bin | 1011101001000110001… |
… | …0001011010001100011 |
3 | 201010021001101102001210 |
4 | 2322101202023101203 |
5 | 11234110044313021 |
6 | 231514451401203 |
7 | 20310303142536 |
oct | 2722142132143 |
9 | 633231342053 |
10 | 200010151011 |
11 | 77907574870 |
12 | 3291abb3203 |
13 | 15b264646a8 |
14 | 99755a4a1d |
15 | 53092cbe76 |
hex | 2e9188b463 |
200010151011 has 16 divisors (see below), whose sum is σ = 300955714560. Its totient is φ = 117038332320.
The previous prime is 200010150979. The next prime is 200010151021. The reversal of 200010151011 is 110151010002.
It is not a de Polignac number, because 200010151011 - 25 = 200010150979 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200010151021) 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 in 15 ways as a sum of consecutive naturals, for example, 104497555 + ... + 104499468.
It is an arithmetic number, because the mean of its divisors is an integer number (18809732160).
Almost surely, 2200010151011 is an apocalyptic number.
200010151011 is a deficient number, since it is larger than the sum of its proper divisors (100945563549).
200010151011 is a wasteful number, since it uses less digits than its factorization.
200010151011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208997066.
The product of its (nonzero) digits is 10, while the sum is 12.
Adding to 200010151011 its reverse (110151010002), we get a palindrome (310161161013).
The spelling of 200010151011 in words is "two hundred billion, ten million, one hundred fifty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •