Base | Representation |
---|---|
bin | 10111001100011100010100… |
… | …011011111010101101111011 |
3 | 111101012001221000222222122202 |
4 | 113030130110123322231323 |
5 | 101332313201421010021 |
6 | 1000542444215540415 |
7 | 30325662435516206 |
oct | 2714342433725573 |
9 | 441161830888582 |
10 | 102010111110011 |
11 | 2a55a277361625 |
12 | b5362ab98a70b |
13 | 44bc6873cb140 |
14 | 1b2945c4a893d |
15 | bbd7b52a6a0b |
hex | 5cc7146fab7b |
102010111110011 has 8 divisors (see below), whose sum is σ = 109860030036624. Its totient is φ = 94160618940960.
The previous prime is 102010111110001. The next prime is 102010111110029. The reversal of 102010111110011 is 110011111010201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102010111110011 - 226 = 102010044001147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102010111109974 and 102010111110001.
It is not an unprimeable number, because it can be changed into a prime (102010111110001) 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, 106192841 + ... + 107149146.
It is an arithmetic number, because the mean of its divisors is an integer number (13732503754578).
Almost surely, 2102010111110011 is an apocalyptic number.
102010111110011 is a deficient number, since it is larger than the sum of its proper divisors (7849918926613).
102010111110011 is a wasteful number, since it uses less digits than its factorization.
102010111110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 213378781.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 102010111110011 its reverse (110011111010201), we get a palindrome (212021222120212).
The spelling of 102010111110011 in words is "one hundred two trillion, ten billion, one hundred eleven million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •