Base | Representation |
---|---|
bin | 10110101111100000101111… |
… | …110010101010110110010111 |
3 | 111010011000021011120112122002 |
4 | 112233200233302222312113 |
5 | 101102230024022413421 |
6 | 552421250023225515 |
7 | 30032231256566252 |
oct | 2657405762526627 |
9 | 433130234515562 |
10 | 100022000201111 |
11 | 299631015aa96a |
12 | b274b255a829b |
13 | 43a705a038621 |
14 | 1a9b13aa06099 |
15 | b86c05e3cb0b |
hex | 5af82fcaad97 |
100022000201111 has 4 divisors (see below), whose sum is σ = 100135532551824. Its totient is φ = 99908467850400.
The previous prime is 100022000201099. The next prime is 100022000201243. The reversal of 100022000201111 is 111102000220001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100022000201111 - 214 = 100022000184727 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100022000201092 and 100022000201101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100022000201911) 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, 56766174035 + ... + 56766175796.
It is an arithmetic number, because the mean of its divisors is an integer number (25033883137956).
Almost surely, 2100022000201111 is an apocalyptic number.
100022000201111 is a deficient number, since it is larger than the sum of its proper divisors (113532350713).
100022000201111 is an equidigital number, since it uses as much as digits as its factorization.
100022000201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113532350712.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100022000201111 its reverse (111102000220001), we get a palindrome (211124000421112).
The spelling of 100022000201111 in words is "one hundred trillion, twenty-two billion, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •