Base | Representation |
---|---|
bin | 1011101001011101111… |
… | …1000100101101111111 |
3 | 201010112000021022112101 |
4 | 2322113133010231333 |
5 | 11234311130013043 |
6 | 231532415445531 |
7 | 20312624641462 |
oct | 2722737045577 |
9 | 633460238471 |
10 | 200110001023 |
11 | 77958973639 |
12 | 329485268a7 |
13 | 15b41054b3a |
14 | 99849572d9 |
15 | 5312e5224d |
hex | 2e977c4b7f |
200110001023 has 8 divisors (see below), whose sum is σ = 210662939520. Its totient is φ = 189559145880.
The previous prime is 200110001017. The next prime is 200110001029. The reversal of 200110001023 is 320100011002.
It is an interprime number because it is at equal distance from previous prime (200110001017) and next prime (200110001029).
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 200110001023 - 221 = 200107903871 is a prime.
It is a super-2 number, since 2×2001100010232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200110001029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 321715 + ... + 709732.
It is an arithmetic number, because the mean of its divisors is an integer number (26332867440).
Almost surely, 2200110001023 is an apocalyptic number.
200110001023 is a deficient number, since it is larger than the sum of its proper divisors (10552938497).
200110001023 is a wasteful number, since it uses less digits than its factorization.
200110001023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1041677.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 200110001023 its reverse (320100011002), we get a palindrome (520210012025).
The spelling of 200110001023 in words is "two hundred billion, one hundred ten million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •