Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …001100001001011110001110 |
3 | 111010110112000102020101022102 |
4 | 112300303221030021132032 |
5 | 101110204322030323042 |
6 | 552530210232315102 |
7 | 30041532103520243 |
oct | 2660635114113616 |
9 | 433415012211272 |
10 | 100111010011022 |
11 | 2999792829853a |
12 | b28a226842a92 |
13 | 43b25739768ba |
14 | 1aa15821cb5ca |
15 | b891b53c4b32 |
hex | 5b0ce930978e |
100111010011022 has 4 divisors (see below), whose sum is σ = 150166515016536. Its totient is φ = 50055505005510.
The previous prime is 100111010010961. The next prime is 100111010011141. The reversal of 100111010011022 is 220110010111001.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1001110100110222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100111010010994 and 100111010011012.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 25027752502754 + ... + 25027752502757.
It is an arithmetic number, because the mean of its divisors is an integer number (37541628754134).
Almost surely, 2100111010011022 is an apocalyptic number.
100111010011022 is a deficient number, since it is larger than the sum of its proper divisors (50055505005514).
100111010011022 is an equidigital number, since it uses as much as digits as its factorization.
100111010011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50055505005513.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100111010011022 its reverse (220110010111001), we get a palindrome (320221020122023).
The spelling of 100111010011022 in words is "one hundred trillion, one hundred eleven billion, ten million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •