Base | Representation |
---|---|
bin | 1001100110011000011110… |
… | …10011110110100001001010 |
3 | 2202202002122200001000121200 |
4 | 10303030033103312201022 |
5 | 10231331310401401442 |
6 | 112521450531045030 |
7 | 4306102000622622 |
oct | 463141723664112 |
9 | 82662580030550 |
10 | 21110021122122 |
11 | 67a978964a439 |
12 | 244b31b440776 |
13 | ba188826356a |
14 | 52da325c5882 |
15 | 2691c04b834c |
hex | 13330f4f684a |
21110021122122 has 24 divisors (see below), whose sum is σ = 45738515081376. Its totient is φ = 7036652786856.
The previous prime is 21110021122109. The next prime is 21110021122193. The reversal of 21110021122122 is 22122112001112.
21110021122122 is a `hidden beast` number, since 211 + 1 + 0 + 0 + 211 + 221 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21110021122095 and 21110021122104.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5233843 + ... + 8343449.
It is an arithmetic number, because the mean of its divisors is an integer number (1905771461724).
Almost surely, 221110021122122 is an apocalyptic number.
21110021122122 is an abundant number, since it is smaller than the sum of its proper divisors (24628493959254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21110021122122 is a wasteful number, since it uses less digits than its factorization.
21110021122122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3486762 (or 3486759 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21110021122122 its reverse (22122112001112), we get a palindrome (43232133123234).
The spelling of 21110021122122 in words is "twenty-one trillion, one hundred ten billion, twenty-one million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •