Base | Representation |
---|---|
bin | 10110110000110011101111… |
… | …010001010000000011110110 |
3 | 111010110112021112011120101020 |
4 | 112300303233101100003312 |
5 | 101110210024133341042 |
6 | 552530224314442010 |
7 | 30041534452515246 |
oct | 2660635721200366 |
9 | 433415245146336 |
10 | 100111112012022 |
11 | 2999797a926391 |
12 | b28a254a33306 |
13 | 43b258bb3b117 |
14 | 1aa159197db26 |
15 | b891be3223ec |
hex | 5b0cef4500f6 |
100111112012022 has 32 divisors (see below), whose sum is σ = 200320837793280. Its totient is φ = 33353936220000.
The previous prime is 100111112011949. The next prime is 100111112012027. The reversal of 100111112012022 is 220210211111001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 100111112011992 and 100111112012010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111112012027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 379899004 + ... + 380162432.
It is an arithmetic number, because the mean of its divisors is an integer number (6260026181040).
Almost surely, 2100111112012022 is an apocalyptic number.
100111112012022 is an abundant number, since it is smaller than the sum of its proper divisors (100209725781258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100111112012022 is a wasteful number, since it uses less digits than its factorization.
100111112012022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294388.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100111112012022 its reverse (220210211111001), we get a palindrome (320321323123023).
The spelling of 100111112012022 in words is "one hundred trillion, one hundred eleven billion, one hundred twelve million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •