Base | Representation |
---|---|
bin | 101101101110100010011000… |
… | …000101010101001000010000 |
3 | 222101001221022200000020201201 |
4 | 231232202120011111020100 |
5 | 202324441441122431000 |
6 | 1551420412105240544 |
7 | 60234503522330233 |
oct | 5556423005251020 |
9 | 871057280006651 |
10 | 201110100202000 |
11 | 590973506a8620 |
12 | 1a680599793154 |
13 | 882a7a7739032 |
14 | 3793ad069541a |
15 | 183b5065e296a |
hex | b6e898155210 |
201110100202000 has 160 divisors (see below), whose sum is σ = 530503478354304. Its totient is φ = 73129346496000.
The previous prime is 201110100201949. The next prime is 201110100202003. The reversal of 201110100202000 is 202001011102.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (201110100202003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1558481482 + ... + 1558610518.
Almost surely, 2201110100202000 is an apocalyptic number.
201110100202000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201110100202000 is an abundant number, since it is smaller than the sum of its proper divisors (329393378152304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201110100202000 is a wasteful number, since it uses less digits than its factorization.
201110100202000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199914 (or 199898 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 201110100202000 its reverse (202001011102), we get a palindrome (201312101213102).
The spelling of 201110100202000 in words is "two hundred one trillion, one hundred ten billion, one hundred million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •