Base | Representation |
---|---|
bin | 101101101101000110001011… |
… | …110100000110011100011000 |
3 | 222100201110210212200121012001 |
4 | 231231012023310012130120 |
5 | 202321331223142023000 |
6 | 1551303121300130344 |
7 | 60224400460412650 |
oct | 5555061364063430 |
9 | 870643725617161 |
10 | 201011110111000 |
11 | 59059373344062 |
12 | 1a6653720969b4 |
13 | 8821360225aa7 |
14 | 378cdbd801360 |
15 | 1838b60d9546a |
hex | b6d18bd06718 |
201011110111000 has 256 divisors, whose sum is σ = 548983514476800. Its totient is φ = 67469022720000.
The previous prime is 201011110110973. The next prime is 201011110111027. The reversal of 201011110111000 is 111011110102.
201011110111000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (201011110110973) and next prime (201011110111027).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 61325722 + ... + 64520278.
It is an arithmetic number, because the mean of its divisors is an integer number (2144466853425).
Almost surely, 2201011110111000 is an apocalyptic number.
201011110111000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201011110111000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (274491757238400).
201011110111000 is an abundant number, since it is smaller than the sum of its proper divisors (347972404365800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201011110111000 is a wasteful number, since it uses less digits than its factorization.
201011110111000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3194775 (or 3194761 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 201011110111000 its reverse (111011110102), we get a palindrome (201122121221102).
The spelling of 201011110111000 in words is "two hundred one trillion, eleven billion, one hundred ten million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •