Base | Representation |
---|---|
bin | 1001010001110110001100… |
… | …1010011111010101111001 |
3 | 1100010022200121221111120221 |
4 | 2110131203022133111321 |
5 | 2314123112010202301 |
6 | 33410455301020041 |
7 | 2102041204565212 |
oct | 224354312372571 |
9 | 40108617844527 |
10 | 10202211022201 |
11 | 32838081729a0 |
12 | 118930b9b4621 |
13 | 5900ab567c53 |
14 | 273b0ab1a409 |
15 | 12a5b255eda1 |
hex | 9476329f579 |
10202211022201 has 8 divisors (see below), whose sum is σ = 11129774635008. Its totient is φ = 9274662390000.
The previous prime is 10202211022103. The next prime is 10202211022313. The reversal of 10202211022201 is 10222011220201.
It is a happy number.
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 10202211022201 - 215 = 10202210989433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10202211026201) 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, 2296825 + ... + 5067526.
It is an arithmetic number, because the mean of its divisors is an integer number (1391221829376).
Almost surely, 210202211022201 is an apocalyptic number.
10202211022201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10202211022201 is a deficient number, since it is larger than the sum of its proper divisors (927563612807).
10202211022201 is a wasteful number, since it uses less digits than its factorization.
10202211022201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7490303.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10202211022201 its reverse (10222011220201), we get a palindrome (20424222242402).
The spelling of 10202211022201 in words is "ten trillion, two hundred two billion, two hundred eleven million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •