Base | Representation |
---|---|
bin | 10011100101000000… |
… | …111111000110010100 |
3 | 2000021001210211201101 |
4 | 103211000333012110 |
5 | 321023130010400 |
6 | 13354000435444 |
7 | 1342642662505 |
oct | 234500770624 |
9 | 60231724641 |
10 | 21022110100 |
11 | 8a08484512 |
12 | 40a8318b84 |
13 | 1ca0386804 |
14 | 1035d4abac |
15 | 83086856a |
hex | 4e503f194 |
21022110100 has 18 divisors (see below), whose sum is σ = 45617979134. Its totient is φ = 8408844000.
The previous prime is 21022110091. The next prime is 21022110107. The reversal of 21022110100 is 101122012.
It can be written as a sum of positive squares in 3 ways, for example, as 7554043396 + 13468066704 = 86914^2 + 116052^2 .
It is a super-2 number, since 2×210221101002 (a number of 21 digits) contains 22 as substring.
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 (21022110107) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 105110451 + ... + 105110650.
Almost surely, 221022110100 is an apocalyptic number.
21022110100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21022110100 is an abundant number, since it is smaller than the sum of its proper divisors (24595869034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21022110100 is a wasteful number, since it uses less digits than its factorization.
21022110100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210221115 (or 210221108 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 21022110100 its reverse (101122012), we get a palindrome (21123232112).
The spelling of 21022110100 in words is "twenty-one billion, twenty-two million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •