Base | Representation |
---|---|
bin | 101101101110011001000100… |
… | …000101110111010010111000 |
3 | 222101000222111210222022112002 |
4 | 231232121010011313102320 |
5 | 202324311001341334313 |
6 | 1551412035554240132 |
7 | 60234000655464212 |
oct | 5556310405672270 |
9 | 871028453868462 |
10 | 201100101121208 |
11 | 5909308a461193 |
12 | 1a67a668b86048 |
13 | 8829872cb1093 |
14 | 37934226d15b2 |
15 | 183b11d867058 |
hex | b6e6441774b8 |
201100101121208 has 16 divisors (see below), whose sum is σ = 389226002170560. Its totient is φ = 97306500542400.
The previous prime is 201100101121207. The next prime is 201100101121277. The reversal of 201100101121208 is 802121101001102.
It is a happy number.
201100101121208 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 201100101121208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201100101121207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 405443752013 + ... + 405443752508.
It is an arithmetic number, because the mean of its divisors is an integer number (24326625135660).
Almost surely, 2201100101121208 is an apocalyptic number.
It is an amenable number.
201100101121208 is a deficient number, since it is larger than the sum of its proper divisors (188125901049352).
201100101121208 is a wasteful number, since it uses less digits than its factorization.
201100101121208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 810887504558 (or 810887504554 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 20.
The spelling of 201100101121208 in words is "two hundred one trillion, one hundred billion, one hundred one million, one hundred twenty-one thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •