Base | Representation |
---|---|
bin | 1001100110011000101000… |
… | …00001001011001010000000 |
3 | 2202202002212011200010100201 |
4 | 10303030110001023022000 |
5 | 10231331441112041000 |
6 | 112521502432054544 |
7 | 4306103650211044 |
oct | 463142401131200 |
9 | 82662764603321 |
10 | 21110100112000 |
11 | 67a981a1a0729 |
12 | 244b341994454 |
13 | ba189b72bc33 |
14 | 52da3cca8024 |
15 | 2691c73bc96a |
hex | 13331404b280 |
21110100112000 has 64 divisors (see below), whose sum is σ = 52484986443240. Its totient is φ = 8444040038400.
The previous prime is 21110100111967. The next prime is 21110100112021. The reversal of 21110100112000 is 21100101112.
It can be written as a sum of positive squares in 4 ways, for example, as 4507604564544 + 16602495547456 = 2123112^2 + 4074616^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (10).
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, 659674629 + ... + 659706628.
Almost surely, 221110100112000 is an apocalyptic number.
21110100112000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21110100112000 is an abundant number, since it is smaller than the sum of its proper divisors (31374886331240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21110100112000 is an equidigital number, since it uses as much as digits as its factorization.
21110100112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1319381286 (or 1319381264 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 21110100112000 its reverse (21100101112), we get a palindrome (21131200213112).
The spelling of 21110100112000 in words is "twenty-one trillion, one hundred ten billion, one hundred million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •