Base | Representation |
---|---|
bin | 1001100011001011100011… |
… | …01010111110011000011000 |
3 | 2202100120200021000202111110 |
4 | 10301211301222332120120 |
5 | 10223031001030413422 |
6 | 112355133503500320 |
7 | 4265125426336104 |
oct | 461456152763030 |
9 | 82316607022443 |
10 | 21000002201112 |
11 | 6767061856730 |
12 | 2431b362b76a0 |
13 | b943a3b703bc |
14 | 528596ab8904 |
15 | 2663d18d460c |
hex | 131971abe618 |
21000002201112 has 64 divisors (see below), whose sum is σ = 57657114144000. Its totient is φ = 6320928045440.
The previous prime is 21000002201111. The next prime is 21000002201161. The reversal of 21000002201112 is 21110220000012.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000002201111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 266891748 + ... + 266970419.
It is an arithmetic number, because the mean of its divisors is an integer number (900892408500).
Almost surely, 221000002201112 is an apocalyptic number.
21000002201112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21000002201112 is an abundant number, since it is smaller than the sum of its proper divisors (36657111942888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000002201112 is a wasteful number, since it uses less digits than its factorization.
21000002201112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 533862336 (or 533862332 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 21000002201112 its reverse (21110220000012), we get a palindrome (42110222201124).
The spelling of 21000002201112 in words is "twenty-one trillion, two million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •