Base | Representation |
---|---|
bin | 1001101001010100100110… |
… | …11100000011010101100110 |
3 | 2210002202100121012220222100 |
4 | 10310222103130003111212 |
5 | 10240010133130041402 |
6 | 113040113052512530 |
7 | 4316305621104354 |
oct | 464522334032546 |
9 | 83082317186870 |
10 | 21211022112102 |
11 | 68385a9015089 |
12 | 2466a0847b746 |
13 | bab263268964 |
14 | 5348945707d4 |
15 | 26bb3252c71c |
hex | 134a93703566 |
21211022112102 has 24 divisors (see below), whose sum is σ = 45957335042736. Its totient is φ = 7070322170736.
The previous prime is 21211022112097. The next prime is 21211022112103. The reversal of 21211022112102 is 20121122011212.
21211022112102 is a `hidden beast` number, since 21 + 211 + 0 + 221 + 1 + 210 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21211022112103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6703728 + ... + 9346764.
It is an arithmetic number, because the mean of its divisors is an integer number (1914888960114).
Almost surely, 221211022112102 is an apocalyptic number.
21211022112102 is an abundant number, since it is smaller than the sum of its proper divisors (24746312930634).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21211022112102 is a wasteful number, since it uses less digits than its factorization.
21211022112102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3088892 (or 3088889 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21211022112102 its reverse (20121122011212), we get a palindrome (41332144123314).
The spelling of 21211022112102 in words is "twenty-one trillion, two hundred eleven billion, twenty-two million, one hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •