Base | Representation |
---|---|
bin | 10110110010011001010000… |
… | …001000001111000100010011 |
3 | 111010211221121212102002120120 |
4 | 112302121100020033010103 |
5 | 101114001241433033021 |
6 | 553052252234041323 |
7 | 30052443532511535 |
oct | 2662312010170423 |
9 | 433757555362516 |
10 | 100220111221011 |
11 | 29a2a124062391 |
12 | b2a73b4579243 |
13 | 43bc93cbb1aa2 |
14 | 1aa6971c8b855 |
15 | b8be4d62e2c6 |
hex | 5b265020f113 |
100220111221011 has 8 divisors (see below), whose sum is σ = 137937357379584. Its totient is φ = 64658136271560.
The previous prime is 100220111221007. The next prime is 100220111221123. The reversal of 100220111221011 is 110122111022001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100220111221011 - 22 = 100220111221007 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100220111291011) 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 7 ways as a sum of consecutive naturals, for example, 538817802171 + ... + 538817802356.
It is an arithmetic number, because the mean of its divisors is an integer number (17242169672448).
Almost surely, 2100220111221011 is an apocalyptic number.
100220111221011 is a deficient number, since it is larger than the sum of its proper divisors (37717246158573).
100220111221011 is a wasteful number, since it uses less digits than its factorization.
100220111221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1077635604561.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100220111221011 its reverse (110122111022001), we get a palindrome (210342222243012).
The spelling of 100220111221011 in words is "one hundred trillion, two hundred twenty billion, one hundred eleven million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •