Base | Representation |
---|---|
bin | 101110101010010000… |
… | …0101011100111100101 |
3 | 100120122020221011000010 |
4 | 1131110200223213211 |
5 | 3120203214214341 |
6 | 114010542440433 |
7 | 10145046543615 |
oct | 1352440534745 |
9 | 316566834003 |
10 | 100202101221 |
11 | 3954a523802 |
12 | 17505593119 |
13 | 95ab651271 |
14 | 4bc7c2ca45 |
15 | 2916d5b716 |
hex | 175482b9e5 |
100202101221 has 32 divisors (see below), whose sum is σ = 135886012416. Its totient is φ = 65672208000.
The previous prime is 100202101151. The next prime is 100202101243. The reversal of 100202101221 is 122101202001.
It is not a de Polignac number, because 100202101221 - 29 = 100202100709 is a prime.
It is a super-2 number, since 2×1002021012212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100202101197 and 100202101206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100202101421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19718401 + ... + 19723481.
It is an arithmetic number, because the mean of its divisors is an integer number (4246437888).
Almost surely, 2100202101221 is an apocalyptic number.
It is an amenable number.
100202101221 is a deficient number, since it is larger than the sum of its proper divisors (35683911195).
100202101221 is a wasteful number, since it uses less digits than its factorization.
100202101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5673.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100202101221 its reverse (122101202001), we get a palindrome (222303303222).
The spelling of 100202101221 in words is "one hundred billion, two hundred two million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •