Base | Representation |
---|---|
bin | 10001011111100011010… |
… | …110001100000100011101 |
3 | 11020220212010021022202020 |
4 | 101133203112030010131 |
5 | 124143410142321341 |
6 | 2320124115450353 |
7 | 152564260300023 |
oct | 21374326140435 |
9 | 4226763238666 |
10 | 1202110120221 |
11 | 4238a29076aa |
12 | 174b882b69b9 |
13 | 8948780a05a |
14 | 4227a88a713 |
15 | 2140a0a1566 |
hex | 117e358c11d |
1202110120221 has 24 divisors (see below), whose sum is σ = 1703295543264. Its totient is φ = 753975970560.
The previous prime is 1202110120213. The next prime is 1202110120249. The reversal of 1202110120221 is 1220210112021.
It is not a de Polignac number, because 1202110120221 - 23 = 1202110120213 is a prime.
It is a super-2 number, since 2×12021101202212 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1202110120221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1202110160221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2007906 + ... + 2536908.
It is an arithmetic number, because the mean of its divisors is an integer number (70970647636).
Almost surely, 21202110120221 is an apocalyptic number.
It is an amenable number.
1202110120221 is a deficient number, since it is larger than the sum of its proper divisors (501185423043).
1202110120221 is a wasteful number, since it uses less digits than its factorization.
1202110120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 531661 (or 531644 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1202110120221 its reverse (1220210112021), we get a palindrome (2422320232242).
The spelling of 1202110120221 in words is "one trillion, two hundred two billion, one hundred ten million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •