Base | Representation |
---|---|
bin | 1001010010010100000010… |
… | …1010110000000000100111 |
3 | 1100011002100221102001210022 |
4 | 2110211000222300000213 |
5 | 2314241013341223421 |
6 | 33414302240345355 |
7 | 2102443552556126 |
oct | 224450052600047 |
9 | 40132327361708 |
10 | 10210222211111 |
11 | 328714929277a |
12 | 118a98691525b |
13 | 590a871c7b10 |
14 | 27426aa97abd |
15 | 12a8d0a1a7ab |
hex | 94940ab0027 |
10210222211111 has 8 divisors (see below), whose sum is σ = 10998800975904. Its totient is φ = 9422097311520.
The previous prime is 10210222211099. The next prime is 10210222211131. The reversal of 10210222211111 is 11111222201201.
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-10210222211111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10210222211111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210222211131) 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, 113419571 + ... + 113509556.
It is an arithmetic number, because the mean of its divisors is an integer number (1374850121988).
Almost surely, 210210222211111 is an apocalyptic number.
10210222211111 is a deficient number, since it is larger than the sum of its proper divisors (788578764793).
10210222211111 is a wasteful number, since it uses less digits than its factorization.
10210222211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226932601.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10210222211111 its reverse (11111222201201), we get a palindrome (21321444412312).
The spelling of 10210222211111 in words is "ten trillion, two hundred ten billion, two hundred twenty-two million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •