Base | Representation |
---|---|
bin | 1001010001110110001100… |
… | …1010011111000101110001 |
3 | 1100010022200121221110011201 |
4 | 2110131203022133011301 |
5 | 2314123112010134134 |
6 | 33410455301011201 |
7 | 2102041204562206 |
oct | 224354312370561 |
9 | 40108617843151 |
10 | 10202211021169 |
11 | 3283808172142 |
12 | 118930b9b3b01 |
13 | 5900ab56763b |
14 | 273b0ab19cad |
15 | 12a5b255e914 |
hex | 9476329f171 |
10202211021169 has 2 divisors, whose sum is σ = 10202211021170. Its totient is φ = 10202211021168.
The previous prime is 10202211021089. The next prime is 10202211021203. The reversal of 10202211021169 is 96112011220201.
10202211021169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10196123900769 + 6087120400 = 3193137^2 + 78020^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10202211021169 is a prime.
It is a super-2 number, since 2×102022110211692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10202211021269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101105510584 + 5101105510585.
It is an arithmetic number, because the mean of its divisors is an integer number (5101105510585).
Almost surely, 210202211021169 is an apocalyptic number.
It is an amenable number.
10202211021169 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202211021169 is an equidigital number, since it uses as much as digits as its factorization.
10202211021169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 28.
The spelling of 10202211021169 in words is "ten trillion, two hundred two billion, two hundred eleven million, twenty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •