Base | Representation |
---|---|
bin | 1001010010111000110110… |
… | …0011111101101000001111 |
3 | 1100012000212111101010020021 |
4 | 2110232031203331220033 |
5 | 2314421232131241421 |
6 | 33423014455203011 |
7 | 2103243442312561 |
oct | 224561543755017 |
9 | 40160774333207 |
10 | 10220102212111 |
11 | 3290359296760 |
12 | 1190883676467 |
13 | 5919a008b95c |
14 | 274926d01331 |
15 | 12acad0c3341 |
hex | 94b8d8fda0f |
10220102212111 has 8 divisors (see below), whose sum is σ = 11533657669200. Its totient is φ = 8970622631040.
The previous prime is 10220102212079. The next prime is 10220102212123. The reversal of 10220102212111 is 11121220102201.
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 10220102212111 - 25 = 10220102212079 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 (10220102212181) 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, 16018968666 + ... + 16018969303.
It is an arithmetic number, because the mean of its divisors is an integer number (1441707208650).
Almost surely, 210220102212111 is an apocalyptic number.
10220102212111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10220102212111 is a deficient number, since it is larger than the sum of its proper divisors (1313555457089).
10220102212111 is a wasteful number, since it uses less digits than its factorization.
10220102212111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32037938009.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10220102212111 its reverse (11121220102201), we get a palindrome (21341322314312).
The spelling of 10220102212111 in words is "ten trillion, two hundred twenty billion, one hundred two million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •