Base | Representation |
---|---|
bin | 10110110010011010001011… |
… | …101110001010101001000110 |
3 | 111010212001012112201011002112 |
4 | 112302122023232022221012 |
5 | 101114010313410120402 |
6 | 553052535351141022 |
7 | 30052510362614642 |
oct | 2662321356125106 |
9 | 433761175634075 |
10 | 100221111020102 |
11 | 29a2a597459226 |
12 | b2a7633374772 |
13 | 43bca6c07b697 |
14 | 1aa6a28985c22 |
15 | b8beab2c0e52 |
hex | 5b268bb8aa46 |
100221111020102 has 8 divisors (see below), whose sum is σ = 150334310731656. Its totient is φ = 50109674109552.
The previous prime is 100221111020101. The next prime is 100221111020117. The reversal of 100221111020102 is 201020111122001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1002211110201022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100221111020101) 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 3 ways as a sum of consecutive naturals, for example, 440558108 + ... + 440785535.
It is an arithmetic number, because the mean of its divisors is an integer number (18791788841457).
Almost surely, 2100221111020102 is an apocalyptic number.
100221111020102 is a deficient number, since it is larger than the sum of its proper divisors (50113199711554).
100221111020102 is an equidigital number, since it uses as much as digits as its factorization.
100221111020102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 881400502.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 100221111020102 its reverse (201020111122001), we get a palindrome (301241222142103).
The spelling of 100221111020102 in words is "one hundred trillion, two hundred twenty-one billion, one hundred eleven million, twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •