Base | Representation |
---|---|
bin | 101101100000001010001001… |
… | …011000001010000010101001 |
3 | 222020120110220000212002211102 |
4 | 231200022021120022002221 |
5 | 202212244334304013001 |
6 | 1545342441020411145 |
7 | 60103223663600555 |
oct | 5540121130120251 |
9 | 866513800762742 |
10 | 200122011001001 |
11 | 588462a5049271 |
12 | 1a540ba06a6ab5 |
13 | 8788569ca296b |
14 | 375bd5808a865 |
15 | 182097587be6b |
hex | b6028960a0a9 |
200122011001001 has 8 divisors (see below), whose sum is σ = 205004585363424. Its totient is φ = 195239510434080.
The previous prime is 200122011000979. The next prime is 200122011001111. The reversal of 200122011001001 is 100100110221002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-200122011001001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200122011001201) 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 7 ways as a sum of consecutive naturals, for example, 12939191 + ... + 23825756.
It is an arithmetic number, because the mean of its divisors is an integer number (25625573170428).
Almost surely, 2200122011001001 is an apocalyptic number.
It is an amenable number.
200122011001001 is a deficient number, since it is larger than the sum of its proper divisors (4882574362423).
200122011001001 is a wasteful number, since it uses less digits than its factorization.
200122011001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36897751.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200122011001001 its reverse (100100110221002), we get a palindrome (300222121222003).
The spelling of 200122011001001 in words is "two hundred trillion, one hundred twenty-two billion, eleven million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •