Base | Representation |
---|---|
bin | 1001100011001101110011… |
… | …01110100011110000110100 |
3 | 2202100200210111210012022012 |
4 | 10301212321232203300310 |
5 | 10223040440020201322 |
6 | 112355453450423352 |
7 | 4265200405660220 |
oct | 461467156436064 |
9 | 82320714705265 |
10 | 21001211100212 |
11 | 67676221904a2 |
12 | 2432213131b58 |
13 | b9453745c305 |
14 | 52866d483780 |
15 | 266452acbae2 |
hex | 1319b9ba3c34 |
21001211100212 has 48 divisors (see below), whose sum is σ = 44547399187200. Its totient is φ = 8456934600192.
The previous prime is 21001211100211. The next prime is 21001211100253. The reversal of 21001211100212 is 21200111210012.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21001211100211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36543083 + ... + 37113330.
It is an arithmetic number, because the mean of its divisors is an integer number (928070816400).
Almost surely, 221001211100212 is an apocalyptic number.
It is an amenable number.
21001211100212 is an abundant number, since it is smaller than the sum of its proper divisors (23546188086988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21001211100212 is a wasteful number, since it uses less digits than its factorization.
21001211100212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73657040 (or 73657038 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 21001211100212 its reverse (21200111210012), we get a palindrome (42201322310224).
The spelling of 21001211100212 in words is "twenty-one trillion, one billion, two hundred eleven million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •