Base | Representation |
---|---|
bin | 101111111110101111111000… |
… | …001000001000011011001000 |
3 | 1000200011100000122012222211202 |
4 | 233332233320020020123020 |
5 | 210124323332440213000 |
6 | 2024445201520443332 |
7 | 62306464205156264 |
oct | 5776577010103310 |
9 | 1020140018188752 |
10 | 211020201101000 |
11 | 6126818a266455 |
12 | 1b801166479548 |
13 | 909917293c025 |
14 | 3a1760a06d0a4 |
15 | 195e1bde89dd5 |
hex | bfebf82086c8 |
211020201101000 has 32 divisors (see below), whose sum is σ = 493787270578680. Its totient is φ = 84408080440000.
The previous prime is 211020201100999. The next prime is 211020201101029. The reversal of 211020201101000 is 101102020112.
It can be written as a sum of positive squares in 4 ways, for example, as 112083002129476 + 98937198971524 = 10586926^2 + 9946718^2 .
It is a super-2 number, since 2×2110202011010002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 105510099551 + ... + 105510101550.
Almost surely, 2211020201101000 is an apocalyptic number.
211020201101000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211020201101000 is an abundant number, since it is smaller than the sum of its proper divisors (282767069477680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211020201101000 is a wasteful number, since it uses less digits than its factorization.
211020201101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211020201122 (or 211020201108 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 211020201101000 its reverse (101102020112), we get a palindrome (211121303121112).
The spelling of 211020201101000 in words is "two hundred eleven trillion, twenty billion, two hundred one million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •