Base | Representation |
---|---|
bin | 10111001101111010011110… |
… | …011010000010001101001011 |
3 | 111101112201212210121211012112 |
4 | 113031322132122002031023 |
5 | 101340442224242320021 |
6 | 1001101124202332535 |
7 | 30336201656105411 |
oct | 2715723632021513 |
9 | 441481783554175 |
10 | 102111210120011 |
11 | 2a599137096154 |
12 | b551a057ba14b |
13 | 44c9079802a51 |
14 | 1b302cd48b2b1 |
15 | bc1230c2dd5b |
hex | 5cde9e68234b |
102111210120011 has 4 divisors (see below), whose sum is σ = 102437444018472. Its totient is φ = 101784976221552.
The previous prime is 102111210119999. The next prime is 102111210120019. The reversal of 102111210120011 is 110021012111201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102111210120011 - 214 = 102111210103627 is a prime.
It is a super-2 number, since 2×1021112101200112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102111210120019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 163116948761 + ... + 163116949386.
It is an arithmetic number, because the mean of its divisors is an integer number (25609361004618).
Almost surely, 2102111210120011 is an apocalyptic number.
102111210120011 is a deficient number, since it is larger than the sum of its proper divisors (326233898461).
102111210120011 is an equidigital number, since it uses as much as digits as its factorization.
102111210120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326233898460.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102111210120011 its reverse (110021012111201), we get a palindrome (212132222231212).
The spelling of 102111210120011 in words is "one hundred two trillion, one hundred eleven billion, two hundred ten million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •