Base | Representation |
---|---|
bin | 1001100011110000110101… |
… | …11001011001010011100101 |
3 | 2202102111100102022021110110 |
4 | 10301320122321121103211 |
5 | 10223343000411400401 |
6 | 112412244152243233 |
7 | 4266434502122460 |
oct | 461703271312345 |
9 | 82374312267413 |
10 | 21020021200101 |
11 | 67745a4a819a0 |
12 | 24359a26a0519 |
13 | b9624446a931 |
14 | 5295357082d7 |
15 | 266ba41549d6 |
hex | 131e1ae594e5 |
21020021200101 has 32 divisors (see below), whose sum is σ = 35463900883968. Its totient is φ = 10756514039040.
The previous prime is 21020021200067. The next prime is 21020021200109. The reversal of 21020021200101 is 10100212002012.
It is not a de Polignac number, because 21020021200101 - 210 = 21020021199077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21020021200109) 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 31 ways as a sum of consecutive naturals, for example, 679057380 + ... + 679088333.
It is an arithmetic number, because the mean of its divisors is an integer number (1108246902624).
Almost surely, 221020021200101 is an apocalyptic number.
21020021200101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
21020021200101 is a deficient number, since it is larger than the sum of its proper divisors (14443879683867).
21020021200101 is a wasteful number, since it uses less digits than its factorization.
21020021200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358145801.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 21020021200101 its reverse (10100212002012), we get a palindrome (31120233202113).
The spelling of 21020021200101 in words is "twenty-one trillion, twenty billion, twenty-one million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •