Base | Representation |
---|---|
bin | 10111001111011111111000… |
… | …110111100110000101110011 |
3 | 111101221010221122220112002011 |
4 | 113033133320313212011303 |
5 | 101344233232103013021 |
6 | 1001223133325303351 |
7 | 30350105263606261 |
oct | 2717377067460563 |
9 | 441833848815064 |
10 | 102220102001011 |
11 | 2a630335786035 |
12 | b56ab35404b57 |
13 | 4506411568627 |
14 | 1b3569d41b431 |
15 | bc3ea58d9de1 |
hex | 5cf7f8de6173 |
102220102001011 has 8 divisors (see below), whose sum is σ = 102327644685744. Its totient is φ = 102112597658400.
The previous prime is 102220102001009. The next prime is 102220102001113. The reversal of 102220102001011 is 110100201022201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102220102001011 - 21 = 102220102001009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102220102000982 and 102220102001000.
It is not an unprimeable number, because it can be changed into a prime (102220102001411) 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, 4249165 + ... + 14916286.
It is an arithmetic number, because the mean of its divisors is an integer number (12790955585718).
Almost surely, 2102220102001011 is an apocalyptic number.
102220102001011 is a deficient number, since it is larger than the sum of its proper divisors (107542684733).
102220102001011 is a wasteful number, since it uses less digits than its factorization.
102220102001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19171061.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102220102001011 its reverse (110100201022201), we get a palindrome (212320303023212).
The spelling of 102220102001011 in words is "one hundred two trillion, two hundred twenty billion, one hundred two million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •