Base | Representation |
---|---|
bin | 1001100110011100100010… |
… | …01111110011111011010100 |
3 | 2202202022021121001102110120 |
4 | 10303032101033303323110 |
5 | 10231400241440213022 |
6 | 112522451123351540 |
7 | 4306210011264330 |
oct | 463162117637324 |
9 | 82668247042416 |
10 | 21112201101012 |
11 | 67aa6a814488a |
12 | 244b8295225b0 |
13 | ba1b44aa4cb8 |
14 | 52db9bd307c0 |
15 | 26929ba7cd5c |
hex | 1333913f3ed4 |
21112201101012 has 48 divisors (see below), whose sum is σ = 56931778270080. Its totient is φ = 5964281528832.
The previous prime is 21112201101007. The next prime is 21112201101037. The reversal of 21112201101012 is 21010110221112.
It is a happy number.
It is a super-3 number, since 3×211122011010123 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21112201100982 and 21112201101000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1411990993 + ... + 1412005944.
It is an arithmetic number, because the mean of its divisors is an integer number (1186078713960).
Almost surely, 221112201101012 is an apocalyptic number.
It is an amenable number.
21112201101012 is an abundant number, since it is smaller than the sum of its proper divisors (35819577169068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112201101012 is a wasteful number, since it uses less digits than its factorization.
21112201101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2823997040 (or 2823997038 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21112201101012 its reverse (21010110221112), we get a palindrome (42122311322124).
The spelling of 21112201101012 in words is "twenty-one trillion, one hundred twelve billion, two hundred one million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •