Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …000100011011111110101011 |
3 | 111010110102200010200122210201 |
4 | 112300302303010123332223 |
5 | 101110200442104120021 |
6 | 552525540155053031 |
7 | 30041500436650156 |
oct | 2660626304337653 |
9 | 433412603618721 |
10 | 100110102020011 |
11 | 299975017a8446 |
12 | b28a012741177 |
13 | 43b245a812c05 |
14 | 1aa14d7790c9d |
15 | b8916081a591 |
hex | 5b0cb311bfab |
100110102020011 has 8 divisors (see below), whose sum is σ = 101524309128000. Its totient is φ = 98704189382400.
The previous prime is 100110102020003. The next prime is 100110102020039. The reversal of 100110102020011 is 110020201011001.
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 100110102020011 - 23 = 100110102020003 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100110102020011.
It is not an unprimeable number, because it can be changed into a prime (100110102020051) 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, 2073593286 + ... + 2073641563.
It is an arithmetic number, because the mean of its divisors is an integer number (12690538641000).
Almost surely, 2100110102020011 is an apocalyptic number.
100110102020011 is a deficient number, since it is larger than the sum of its proper divisors (1414207107989).
100110102020011 is a wasteful number, since it uses less digits than its factorization.
100110102020011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4147235189.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100110102020011 its reverse (110020201011001), we get a palindrome (210130303031012).
The spelling of 100110102020011 in words is "one hundred trillion, one hundred ten billion, one hundred two million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •