Base | Representation |
---|---|
bin | 101111110000001101010100… |
… | …010011100011111010101100 |
3 | 1000112121210222000010011220012 |
4 | 233300031110103203322230 |
5 | 210011441022134033400 |
6 | 2022402154050512352 |
7 | 62144342444626424 |
oct | 5760152423437254 |
9 | 1015553860104805 |
10 | 210021020221100 |
11 | 60a12461750620 |
12 | 1b67b5928956b8 |
13 | 9025b8828c14a |
14 | 39c110072b484 |
15 | 19431de5c5d35 |
hex | bf03544e3eac |
210021020221100 has 72 divisors (see below), whose sum is σ = 497179324872048. Its totient is φ = 76370928076800.
The previous prime is 210021020221091. The next prime is 210021020221109. The reversal of 210021020221100 is 1122020120012.
It is an interprime number because it is at equal distance from previous prime (210021020221091) and next prime (210021020221109).
It is not an unprimeable number, because it can be changed into a prime (210021020221109) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 426854432 + ... + 427346168.
Almost surely, 2210021020221100 is an apocalyptic number.
210021020221100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210021020221100 is an abundant number, since it is smaller than the sum of its proper divisors (287158304650948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210021020221100 is a wasteful number, since it uses less digits than its factorization.
210021020221100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880035 (or 880028 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 210021020221100 its reverse (1122020120012), we get a palindrome (211143040341112).
The spelling of 210021020221100 in words is "two hundred ten trillion, twenty-one billion, twenty million, two hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •