Base | Representation |
---|---|
bin | 1001100011001011100011… |
… | …01010001101110100100100 |
3 | 2202100120200020122122122210 |
4 | 10301211301222031310210 |
5 | 10223031001003032322 |
6 | 112355133455323420 |
7 | 4265125424550162 |
oct | 461456152156444 |
9 | 82316606578583 |
10 | 21000002002212 |
11 | 6767061730252 |
12 | 2431b36220570 |
13 | b943a3b009cc |
14 | 528596a66232 |
15 | 2663d189570c |
hex | 131971a8dd24 |
21000002002212 has 12 divisors (see below), whose sum is σ = 49000004671856. Its totient is φ = 7000000667400.
The previous prime is 21000002002211. The next prime is 21000002002219. The reversal of 21000002002212 is 21220020000012.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 1750000166851 = 21000002002212 / (2 + 1 + 0 + 0 + 0 + 0 + 0 + 2 + 0 + 0 + 2 + 2 + 1 + 2).
It is not an unprimeable number, because it can be changed into a prime (21000002002211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 875000083414 + ... + 875000083437.
Almost surely, 221000002002212 is an apocalyptic number.
It is an amenable number.
21000002002212 is an abundant number, since it is smaller than the sum of its proper divisors (28000002669644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000002002212 is a wasteful number, since it uses less digits than its factorization.
21000002002212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1750000166858 (or 1750000166856 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 21000002002212 its reverse (21220020000012), we get a palindrome (42220022002224).
The spelling of 21000002002212 in words is "twenty-one trillion, two million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •