Base | Representation |
---|---|
bin | 101110101010110010… |
… | …1110011111011110101 |
3 | 100120200112000211201022 |
4 | 1131111211303323311 |
5 | 3120222334120341 |
6 | 114012431110525 |
7 | 10145356561466 |
oct | 1352545637365 |
9 | 316615024638 |
10 | 100220223221 |
11 | 39559781068 |
12 | 1750b672445 |
13 | 95b2327941 |
14 | 4bca3c8d6d |
15 | 291873ae4b |
hex | 1755973ef5 |
100220223221 has 2 divisors, whose sum is σ = 100220223222. Its totient is φ = 100220223220.
The previous prime is 100220223217. The next prime is 100220223251. The reversal of 100220223221 is 122322022001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98712842596 + 1507380625 = 314186^2 + 38825^2 .
It is a cyclic number.
It is not a de Polignac number, because 100220223221 - 22 = 100220223217 is a prime.
It is a super-2 number, since 2×1002202232212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100220223221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100220223251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50110111610 + 50110111611.
It is an arithmetic number, because the mean of its divisors is an integer number (50110111611).
Almost surely, 2100220223221 is an apocalyptic number.
It is an amenable number.
100220223221 is a deficient number, since it is larger than the sum of its proper divisors (1).
100220223221 is an equidigital number, since it uses as much as digits as its factorization.
100220223221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 100220223221 its reverse (122322022001), we get a palindrome (222542245222).
The spelling of 100220223221 in words is "one hundred billion, two hundred twenty million, two hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •