Base | Representation |
---|---|
bin | 1001100110000110001110… |
… | …01011011011011111000101 |
3 | 2202201011100200102020222011 |
4 | 10303003013023123133011 |
5 | 10231201223040120401 |
6 | 112513150244534221 |
7 | 4305304101261616 |
oct | 463030713333705 |
9 | 82634320366864 |
10 | 21100221020101 |
11 | 67a560a758773 |
12 | 24494453b1371 |
13 | ba0985ac5b22 |
14 | 52d382c19c0d |
15 | 268ce9e44451 |
hex | 1330c72db7c5 |
21100221020101 has 8 divisors (see below), whose sum is σ = 21781026435584. Its totient is φ = 20419425174960.
The previous prime is 21100221020083. The next prime is 21100221020257. The reversal of 21100221020101 is 10102012200112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21100221020101 - 227 = 21100086802373 is a prime.
It is a super-2 number, since 2×211002210201012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21100221024101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2229835 + ... + 6868231.
It is an arithmetic number, because the mean of its divisors is an integer number (2722628304448).
Almost surely, 221100221020101 is an apocalyptic number.
It is an amenable number.
21100221020101 is a deficient number, since it is larger than the sum of its proper divisors (680805415483).
21100221020101 is a wasteful number, since it uses less digits than its factorization.
21100221020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4785171.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21100221020101 its reverse (10102012200112), we get a palindrome (31202233220213).
The spelling of 21100221020101 in words is "twenty-one trillion, one hundred billion, two hundred twenty-one million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.212 sec. • engine limits •