Base | Representation |
---|---|
bin | 1001100011001101011011… |
… | …01111100000011011010100 |
3 | 2202100200021111102100222201 |
4 | 10301212231233200123110 |
5 | 10223040032031201400 |
6 | 112355421504534244 |
7 | 4265162414562523 |
oct | 461465557403324 |
9 | 82320244370881 |
10 | 21001010022100 |
11 | 6767529731539 |
12 | 2432177921384 |
13 | b945048b8394 |
14 | 5286508a04ba |
15 | 26644010d06a |
hex | 1319adbe06d4 |
21001010022100 has 36 divisors (see below), whose sum is σ = 46149054952000. Its totient is φ = 8294069777760.
The previous prime is 21001010022079. The next prime is 21001010022103. The reversal of 21001010022100 is 122001010012.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21001010022103) 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 11 ways as a sum of consecutive naturals, for example, 1329169950 + ... + 1329185749.
Almost surely, 221001010022100 is an apocalyptic number.
21001010022100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21001010022100 is an abundant number, since it is smaller than the sum of its proper divisors (25148044929900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21001010022100 is a wasteful number, since it uses less digits than its factorization.
21001010022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2658355792 (or 2658355785 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 21001010022100 its reverse (122001010012), we get a palindrome (21123011032112).
The spelling of 21001010022100 in words is "twenty-one trillion, one billion, ten million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •