Base | Representation |
---|---|
bin | 10111001111010111011010… |
… | …010110010000010101111111 |
3 | 111101220021110022220110212002 |
4 | 113033113122112100111333 |
5 | 101344111112000310421 |
6 | 1001215030222132515 |
7 | 30346333602141536 |
oct | 2717273226202577 |
9 | 441807408813762 |
10 | 102211000010111 |
11 | 2a627494963603 |
12 | b56921512113b |
13 | 45055c09285b5 |
14 | 1b3507865731d |
15 | bc3b217b3b0b |
hex | 5cf5da59057f |
102211000010111 has 4 divisors (see below), whose sum is σ = 102223515140112. Its totient is φ = 102198484880112.
The previous prime is 102211000010089. The next prime is 102211000010113. The reversal of 102211000010111 is 111010000112201.
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 102211000010111 - 226 = 102210932901247 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102211000010092 and 102211000010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102211000010113) 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, 6257552750 + ... + 6257569083.
It is an arithmetic number, because the mean of its divisors is an integer number (25555878785028).
Almost surely, 2102211000010111 is an apocalyptic number.
102211000010111 is a deficient number, since it is larger than the sum of its proper divisors (12515130001).
102211000010111 is an equidigital number, since it uses as much as digits as its factorization.
102211000010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12515130000.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102211000010111 its reverse (111010000112201), we get a palindrome (213221000122312).
The spelling of 102211000010111 in words is "one hundred two trillion, two hundred eleven billion, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •