Base | Representation |
---|---|
bin | 101101011111110110110000… |
… | …111101010000010100110011 |
3 | 222020111111011200122221002102 |
4 | 231133312300331100110303 |
5 | 202211424224222413021 |
6 | 1545325120005011015 |
7 | 60101556164656364 |
oct | 5537666075202463 |
9 | 866444150587072 |
10 | 200101200201011 |
11 | 5883849598220a |
12 | 1a538b530b3a6b |
13 | 8786601633425 |
14 | 375ad42227b6b |
15 | 182015885400b |
hex | b5fdb0f50533 |
200101200201011 has 8 divisors (see below), whose sum is σ = 200151346886400. Its totient is φ = 200051054501760.
The previous prime is 200101200200939. The next prime is 200101200201013. The reversal of 200101200201011 is 110102002101002.
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 200101200201011 - 230 = 200100126459187 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200101200200983 and 200101200201001.
It is not an unprimeable number, because it can be changed into a prime (200101200201013) 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, 567697835 + ... + 568050203.
It is an arithmetic number, because the mean of its divisors is an integer number (25018918360800).
Almost surely, 2200101200201011 is an apocalyptic number.
200101200201011 is a deficient number, since it is larger than the sum of its proper divisors (50146685389).
200101200201011 is a wasteful number, since it uses less digits than its factorization.
200101200201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493069.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200101200201011 its reverse (110102002101002), we get a palindrome (310203202302013).
The spelling of 200101200201011 in words is "two hundred trillion, one hundred one billion, two hundred million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •