Base | Representation |
---|---|
bin | 10110101111100000111100… |
… | …010110111010110001010101 |
3 | 111010011000210212021202122012 |
4 | 112233200330112322301111 |
5 | 101102230442010430401 |
6 | 552421322554114005 |
7 | 30032236426605113 |
oct | 2657407426726125 |
9 | 433130725252565 |
10 | 100022211030101 |
11 | 299631aa6098a8 |
12 | b274b8411b905 |
13 | 43a70919148c9 |
14 | 1a9b15aa06ab3 |
15 | b86c196d58bb |
hex | 5af83c5bac55 |
100022211030101 has 4 divisors (see below), whose sum is σ = 100028779785792. Its totient is φ = 100015642274412.
The previous prime is 100022211030097. The next prime is 100022211030127. The reversal of 100022211030101 is 101030112220001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100022211030101 - 22 = 100022211030097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100022211330101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3284355005 + ... + 3284385458.
It is an arithmetic number, because the mean of its divisors is an integer number (25007194946448).
Almost surely, 2100022211030101 is an apocalyptic number.
It is an amenable number.
100022211030101 is a deficient number, since it is larger than the sum of its proper divisors (6568755691).
100022211030101 is an equidigital number, since it uses as much as digits as its factorization.
100022211030101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6568755690.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 100022211030101 its reverse (101030112220001), we get a palindrome (201052323250102).
The spelling of 100022211030101 in words is "one hundred trillion, twenty-two billion, two hundred eleven million, thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •