Base | Representation |
---|---|
bin | 1011101001111010110… |
… | …1000111010010110111 |
3 | 201010211110011220102022 |
4 | 2322132231013102313 |
5 | 11240033131401403 |
6 | 231552423503355 |
7 | 20315625312245 |
oct | 2723655072267 |
9 | 633743156368 |
10 | 200231122103 |
11 | 77a10280701 |
12 | 32980bb7b5b |
13 | 15b6018210c |
14 | 9996a85795 |
15 | 531d8c9d38 |
hex | 2e9eb474b7 |
200231122103 has 8 divisors (see below), whose sum is σ = 209402172000. Its totient is φ = 191098851328.
The previous prime is 200231122097. The next prime is 200231122111. The reversal of 200231122103 is 301221132002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200231122103 - 212 = 200231118007 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200231122163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9684218 + ... + 9704871.
It is an arithmetic number, because the mean of its divisors is an integer number (26175271500).
Almost surely, 2200231122103 is an apocalyptic number.
200231122103 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
200231122103 is a deficient number, since it is larger than the sum of its proper divisors (9171049897).
200231122103 is a wasteful number, since it uses less digits than its factorization.
200231122103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19389561.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 200231122103 its reverse (301221132002), we get a palindrome (501452254105).
The spelling of 200231122103 in words is "two hundred billion, two hundred thirty-one million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •