Base | Representation |
---|---|
bin | 11011010101011100100010… |
… | …101001111100001101011001 |
3 | 120202200000102221222012222120 |
4 | 123111130202221330031121 |
5 | 111224200112304032301 |
6 | 1103404434153411453 |
7 | 34215452503541304 |
oct | 3325344251741531 |
9 | 522600387865876 |
10 | 120221011002201 |
11 | 3534049861233a |
12 | 11597779409b89 |
13 | 5210a3c713715 |
14 | 2198a29809b3b |
15 | dd735749be36 |
hex | 6d5722a7c359 |
120221011002201 has 12 divisors (see below), whose sum is σ = 164744058910032. Its totient is φ = 77981196323088.
The previous prime is 120221011002199. The next prime is 120221011002203. The reversal of 120221011002201 is 102200110122021.
It is an interprime number because it is at equal distance from previous prime (120221011002199) and next prime (120221011002203).
It is not a de Polignac number, because 120221011002201 - 21 = 120221011002199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120221011002203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14636106315 + ... + 14636114528.
It is an arithmetic number, because the mean of its divisors is an integer number (13728671575836).
Almost surely, 2120221011002201 is an apocalyptic number.
It is an amenable number.
120221011002201 is a deficient number, since it is larger than the sum of its proper divisors (44523047907831).
120221011002201 is an equidigital number, since it uses as much as digits as its factorization.
120221011002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29272220920 (or 29272220883 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120221011002201 its reverse (102200110122021), we get a palindrome (222421121124222).
The spelling of 120221011002201 in words is "one hundred twenty trillion, two hundred twenty-one billion, eleven million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •