Base | Representation |
---|---|
bin | 1001100011100000010000… |
… | …10110011001001100010000 |
3 | 2202101122101002022112202111 |
4 | 10301300020112121030100 |
5 | 10223221233221200422 |
6 | 112404213022555104 |
7 | 4266001100042602 |
oct | 461601026311420 |
9 | 82348332275674 |
10 | 21011120100112 |
11 | 67708475a080a |
12 | 2434119738a94 |
13 | b9545633756c |
14 | 528d2d4b9172 |
15 | 2668329b1a77 |
hex | 131c08599310 |
21011120100112 has 20 divisors (see below), whose sum is σ = 41477140387980. Its totient is φ = 10307341935488.
The previous prime is 21011120100071. The next prime is 21011120100143. The reversal of 21011120100112 is 21100102111012.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 7900956426496 + 13110163673616 = 2810864^2 + 3620796^2 .
It is a super-2 number, since 2×210111201001122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21011120100092 and 21011120100101.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12388631287 + ... + 12388632982.
It is an arithmetic number, because the mean of its divisors is an integer number (2073857019399).
Almost surely, 221011120100112 is an apocalyptic number.
It is an amenable number.
21011120100112 is a deficient number, since it is larger than the sum of its proper divisors (20466020287868).
21011120100112 is a wasteful number, since it uses less digits than its factorization.
21011120100112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24777264330 (or 24777264324 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21011120100112 its reverse (21100102111012), we get a palindrome (42111222211124).
The spelling of 21011120100112 in words is "twenty-one trillion, eleven billion, one hundred twenty million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •