Base | Representation |
---|---|
bin | 1100010010000111010… |
… | …1101100010111101000 |
3 | 202011200102110122022002 |
4 | 3010201311230113220 |
5 | 11424132401333000 |
6 | 240535230550132 |
7 | 21150204635054 |
oct | 3044165542750 |
9 | 664612418262 |
10 | 211021121000 |
11 | 81547a15568 |
12 | 34a92668348 |
13 | 16b8c730251 |
14 | a2dbaccc64 |
15 | 5750cd68d5 |
hex | 3121d6c5e8 |
211021121000 has 128 divisors (see below), whose sum is σ = 496356400800. Its totient is φ = 83971123200.
The previous prime is 211021120987. The next prime is 211021121021. The reversal of 211021121000 is 121120112.
It can be written as a sum of positive squares in 16 ways, for example, as 9403956676 + 201617164324 = 96974^2 + 449018^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 254548586 + ... + 254549414.
Almost surely, 2211021121000 is an apocalyptic number.
211021121000 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 211021121000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (248178200400).
211021121000 is an abundant number, since it is smaller than the sum of its proper divisors (285335279800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211021121000 is a wasteful number, since it uses less digits than its factorization.
211021121000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1864 (or 1850 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 211021121000 its reverse (121120112), we get a palindrome (211142241112).
The spelling of 211021121000 in words is "two hundred eleven billion, twenty-one million, one hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.249 sec. • engine limits •