Base | Representation |
---|---|
bin | 10110110010001111111100… |
… | …000001000001110100100011 |
3 | 111010210222210212120001211002 |
4 | 112302033330001001310203 |
5 | 101113320301142023021 |
6 | 553043520011342215 |
7 | 30051640642464455 |
oct | 2662177401016443 |
9 | 433728725501732 |
10 | 100210110111011 |
11 | 29a2596175a41a |
12 | b2a548315196b |
13 | 43bba07bc6314 |
14 | 1aa62a391a2d5 |
15 | b8ba6560250b |
hex | 5b23fc041d23 |
100210110111011 has 8 divisors (see below), whose sum is σ = 100270135314720. Its totient is φ = 100150096110592.
The previous prime is 100210110110969. The next prime is 100210110111017. The reversal of 100210110111011 is 110111011012001.
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 100210110111011 - 26 = 100210110110947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100210110110983 and 100210110111001.
It is not an unprimeable number, because it can be changed into a prime (100210110111017) 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, 15128291 + ... + 20719203.
It is an arithmetic number, because the mean of its divisors is an integer number (12533766914340).
Almost surely, 2100210110111011 is an apocalyptic number.
100210110111011 is a deficient number, since it is larger than the sum of its proper divisors (60025203709).
100210110111011 is an equidigital number, since it uses as much as digits as its factorization.
100210110111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5601645.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 100210110111011 its reverse (110111011012001), we get a palindrome (210321121123012).
The spelling of 100210110111011 in words is "one hundred trillion, two hundred ten billion, one hundred ten million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •