Base | Representation |
---|---|
bin | 101111100011011110… |
… | …0100000111011101111 |
3 | 100202121001120010011102 |
4 | 1133012330200323233 |
5 | 3133121213000421 |
6 | 114525244513315 |
7 | 10243451451515 |
oct | 1370674407357 |
9 | 322531503142 |
10 | 102122000111 |
11 | 3a3452301aa |
12 | 1796054b83b |
13 | 9826331201 |
14 | 4d2abd64b5 |
15 | 29ca69a60b |
hex | 17c6f20eef |
102122000111 has 8 divisors (see below), whose sum is σ = 104375656704. Its totient is φ = 99871712280.
The previous prime is 102122000051. The next prime is 102122000129. The reversal of 102122000111 is 111000221201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102122000111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102122000092 and 102122000101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102122009111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 780845 + ... + 902198.
It is an arithmetic number, because the mean of its divisors is an integer number (13046957088).
Almost surely, 2102122000111 is an apocalyptic number.
102122000111 is a deficient number, since it is larger than the sum of its proper divisors (2253656593).
102122000111 is a wasteful number, since it uses less digits than its factorization.
102122000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1684381.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102122000111 its reverse (111000221201), we get a palindrome (213122221312).
The spelling of 102122000111 in words is "one hundred two billion, one hundred twenty-two million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •