Base | Representation |
---|---|
bin | 10110110010000111100100… |
… | …010010001001011110000011 |
3 | 111010210010121110212021112111 |
4 | 112302013210102021132003 |
5 | 101113143344213323021 |
6 | 553035432053240151 |
7 | 30051202133055340 |
oct | 2662074422113603 |
9 | 433703543767474 |
10 | 100201122011011 |
11 | 29a2206a1568aa |
12 | b2a3795033057 |
13 | 43bac04a51658 |
14 | 1aa5a8dd217c7 |
15 | b8b6db4c68e1 |
hex | 5b21e4489783 |
100201122011011 has 8 divisors (see below), whose sum is σ = 114583049209440. Its totient is φ = 85836065111808.
The previous prime is 100201122010993. The next prime is 100201122011057. The reversal of 100201122011011 is 110110221102001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100201122011011 - 29 = 100201122010499 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100201122010982 and 100201122011000.
It is not an unprimeable number, because it can be changed into a prime (100201122015011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4217562076 + ... + 4217585833.
It is an arithmetic number, because the mean of its divisors is an integer number (14322881151180).
Almost surely, 2100201122011011 is an apocalyptic number.
100201122011011 is a deficient number, since it is larger than the sum of its proper divisors (14381927198429).
100201122011011 is an equidigital number, since it uses as much as digits as its factorization.
100201122011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8435149613.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100201122011011 its reverse (110110221102001), we get a palindrome (210311343113012).
The spelling of 100201122011011 in words is "one hundred trillion, two hundred one billion, one hundred twenty-two million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •