Base | Representation |
---|---|
bin | 10111001101110000001111… |
… | …011101101110001011111111 |
3 | 111101111200112000120000010012 |
4 | 113031300033131232023333 |
5 | 101340302223313310421 |
6 | 1001052110001133435 |
7 | 30335332452523523 |
oct | 2715601735561377 |
9 | 441450460500105 |
10 | 102100222010111 |
11 | 2a594508639596 |
12 | b54b85992a27b |
13 | 44c80181ac380 |
14 | 1b2d969dd3d83 |
15 | bc0cdb23c95b |
hex | 5cdc0f76e2ff |
102100222010111 has 48 divisors (see below), whose sum is σ = 118900678327200. Its totient is φ = 87094875248640.
The previous prime is 102100222010099. The next prime is 102100222010123. The reversal of 102100222010111 is 111010222001201.
It is an interprime number because it is at equal distance from previous prime (102100222010099) and next prime (102100222010123).
It is not a de Polignac number, because 102100222010111 - 210 = 102100222009087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100222010411) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 153236615 + ... + 153901463.
It is an arithmetic number, because the mean of its divisors is an integer number (2477097465150).
Almost surely, 2102100222010111 is an apocalyptic number.
102100222010111 is a deficient number, since it is larger than the sum of its proper divisors (16800456317089).
102100222010111 is a wasteful number, since it uses less digits than its factorization.
102100222010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 665704 (or 665685 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102100222010111 its reverse (111010222001201), we get a palindrome (213110444011312).
The spelling of 102100222010111 in words is "one hundred two trillion, one hundred billion, two hundred twenty-two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •