Base | Representation |
---|---|
bin | 1011101001011101111… |
… | …1110101100010101001 |
3 | 201010112000122110211222 |
4 | 2322113133311202221 |
5 | 11234311202413001 |
6 | 231532424031425 |
7 | 20312626433504 |
oct | 2722737654251 |
9 | 633460573758 |
10 | 200110201001 |
11 | 77958a9a907 |
12 | 32948602575 |
13 | 15b410c4b79 |
14 | 99849aa13b |
15 | 5312e9161b |
hex | 2e977f58a9 |
200110201001 has 8 divisors (see below), whose sum is σ = 203762832000. Its totient is φ = 196485559920.
The previous prime is 200110200977. The next prime is 200110201009. The reversal of 200110201001 is 100102011002.
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 200110201001 - 222 = 200106006697 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200110201001.
It is not an unprimeable number, because it can be changed into a prime (200110201009) 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, 6983051 + ... + 7011648.
It is an arithmetic number, because the mean of its divisors is an integer number (25470354000).
Almost surely, 2200110201001 is an apocalyptic number.
It is an amenable number.
200110201001 is a deficient number, since it is larger than the sum of its proper divisors (3652630999).
200110201001 is a wasteful number, since it uses less digits than its factorization.
200110201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13994959.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 200110201001 its reverse (100102011002), we get a palindrome (300212212003).
The spelling of 200110201001 in words is "two hundred billion, one hundred ten million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •