Base | Representation |
---|---|
bin | 1001101001010100110010… |
… | …11001111001100110000000 |
3 | 2210002202121120120111010100 |
4 | 10310222121121321212000 |
5 | 10240010334241224300 |
6 | 113040131030202400 |
7 | 4316311244661435 |
oct | 464523131714600 |
9 | 83082546514110 |
10 | 21211122211200 |
11 | 683864a574009 |
12 | 2466a35ab3400 |
13 | bab27ac155ac |
14 | 5348a3989b8c |
15 | 26bb3b201700 |
hex | 134a99679980 |
21211122211200 has 288 divisors, whose sum is σ = 76815795873960. Its totient is φ = 5571876372480.
The previous prime is 21211122211183. The next prime is 21211122211259. The reversal of 21211122211200 is 211222111212.
21211122211200 is a `hidden beast` number, since 21 + 211 + 1 + 22 + 211 + 200 = 666.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 3566649 + ... + 7425848.
Almost surely, 221211122211200 is an apocalyptic number.
21211122211200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21211122211200 is an abundant number, since it is smaller than the sum of its proper divisors (55604673662760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21211122211200 is a wasteful number, since it uses less digits than its factorization.
21211122211200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10992594 (or 10992574 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21211122211200 its reverse (211222111212), we get a palindrome (21422344322412).
The spelling of 21211122211200 in words is "twenty-one trillion, two hundred eleven billion, one hundred twenty-two million, two hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •