Base | Representation |
---|---|
bin | 1001100110011000101010… |
… | …10010001000000100001000 |
3 | 2202202002220122121021002200 |
4 | 10303030111102020010020 |
5 | 10231332012030124000 |
6 | 112521504511000200 |
7 | 4306104325453620 |
oct | 463142522100410 |
9 | 82662818537080 |
10 | 21110121333000 |
11 | 67a9830175347 |
12 | 244b348b09060 |
13 | ba18a2c4c03b |
14 | 52da41a2d880 |
15 | 2691c91b0500 |
hex | 133315488108 |
21110121333000 has 192 divisors, whose sum is σ = 81545383221120. Its totient is φ = 4825170576000.
The previous prime is 21110121332987. The next prime is 21110121333019. The reversal of 21110121333000 is 33312101112.
21110121333000 is a `hidden beast` number, since 21 + 1 + 101 + 213 + 330 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 167477646 + ... + 167603645.
It is an arithmetic number, because the mean of its divisors is an integer number (424715537610).
Almost surely, 221110121333000 is an apocalyptic number.
21110121333000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21110121333000 is an abundant number, since it is smaller than the sum of its proper divisors (60435261888120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21110121333000 is a wasteful number, since it uses less digits than its factorization.
21110121333000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335081325 (or 335081308 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 21110121333000 its reverse (33312101112), we get a palindrome (21143433434112).
The spelling of 21110121333000 in words is "twenty-one trillion, one hundred ten billion, one hundred twenty-one million, three hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •