Base | Representation |
---|---|
bin | 1001010010010011100110… |
… | …0001000001110110000011 |
3 | 1100011002001120121222221222 |
4 | 2110210321201001312003 |
5 | 2314240242132102321 |
6 | 33414242312505255 |
7 | 2102440564642223 |
oct | 224447141016603 |
9 | 40132046558858 |
10 | 10210102222211 |
11 | 32870975892a1 |
12 | 118a9526ab22b |
13 | 590a683a5c78 |
14 | 274258b82083 |
15 | 12a8c52183ab |
hex | 94939841d83 |
10210102222211 has 8 divisors (see below), whose sum is σ = 10747598258880. Its totient is φ = 9672618409128.
The previous prime is 10210102222157. The next prime is 10210102222213. The reversal of 10210102222211 is 11222220101201.
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-10210102222211 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 10210102222211.
It is not an unprimeable number, because it can be changed into a prime (10210102222213) 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, 1315961 + ... + 4706586.
It is an arithmetic number, because the mean of its divisors is an integer number (1343449782360).
Almost surely, 210210102222211 is an apocalyptic number.
10210102222211 is a deficient number, since it is larger than the sum of its proper divisors (537496036669).
10210102222211 is an equidigital number, since it uses as much as digits as its factorization.
10210102222211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6111793.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10210102222211 its reverse (11222220101201), we get a palindrome (21432322323412).
The spelling of 10210102222211 in words is "ten trillion, two hundred ten billion, one hundred two million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •