Base | Representation |
---|---|
bin | 11011010011101100111110… |
… | …101011001010111000011001 |
3 | 120202020120020122211112001221 |
4 | 123103230332223022320121 |
5 | 111220214300313032301 |
6 | 1103233423435412041 |
7 | 34204012146046246 |
oct | 3323547653127031 |
9 | 522216218745057 |
10 | 120101222002201 |
11 | 352a4707873690 |
12 | 115785082b4021 |
13 | 520265c16542b |
14 | 2192d0450a5cd |
15 | dd4195cc4da1 |
hex | 6d3b3eacae19 |
120101222002201 has 16 divisors (see below), whose sum is σ = 135310615499520. Its totient is φ = 105659215108480.
The previous prime is 120101222002189. The next prime is 120101222002217. The reversal of 120101222002201 is 102200222101021.
It is a happy number.
It is not a de Polignac number, because 120101222002201 - 211 = 120101222000153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120101222002231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1305033226 + ... + 1305125251.
It is an arithmetic number, because the mean of its divisors is an integer number (8456913468720).
Almost surely, 2120101222002201 is an apocalyptic number.
120101222002201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120101222002201 is a deficient number, since it is larger than the sum of its proper divisors (15209393497319).
120101222002201 is a wasteful number, since it uses less digits than its factorization.
120101222002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2610158624.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 120101222002201 its reverse (102200222101021), we get a palindrome (222301444103222).
The spelling of 120101222002201 in words is "one hundred twenty trillion, one hundred one billion, two hundred twenty-two million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •