Base | Representation |
---|---|
bin | 10111001101111001011100… |
… | …110101011100101010011011 |
3 | 111101112122001010120102222201 |
4 | 113031321130311130222123 |
5 | 101340433001130310021 |
6 | 1001100423103231031 |
7 | 30336132500243545 |
oct | 2715713465345233 |
9 | 441478033512881 |
10 | 102110110010011 |
11 | 2a598722106234 |
12 | b5517592a8477 |
13 | 44c8c32913c9c |
14 | 1b30227320695 |
15 | bc11b9375591 |
hex | 5cde5cd5ca9b |
102110110010011 has 8 divisors (see below), whose sum is σ = 102117357351504. Its totient is φ = 102102862985760.
The previous prime is 102110110009949. The next prime is 102110110010087. The reversal of 102110110010011 is 110010011011201.
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 102110110010011 - 27 = 102110110009883 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 102110110010011.
It is not an unprimeable number, because it can be changed into a prime (102110110016011) 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, 1112494941 + ... + 1112586721.
It is an arithmetic number, because the mean of its divisors is an integer number (12764669668938).
Almost surely, 2102110110010011 is an apocalyptic number.
102110110010011 is a deficient number, since it is larger than the sum of its proper divisors (7247341493).
102110110010011 is an equidigital number, since it uses as much as digits as its factorization.
102110110010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158621.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 102110110010011 its reverse (110010011011201), we get a palindrome (212120121021212).
The spelling of 102110110010011 in words is "one hundred two trillion, one hundred ten billion, one hundred ten million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •