Base | Representation |
---|---|
bin | 11011010011101100111101… |
… | …010111101000001101001100 |
3 | 120202020120012010121212221112 |
4 | 123103230331113220031030 |
5 | 111220214224211232340 |
6 | 1103233421334151152 |
7 | 34204011461645021 |
oct | 3323547527501514 |
9 | 522216163555845 |
10 | 120101200102220 |
11 | 352a46a6475927 |
12 | 11578500ab24b8 |
13 | 520265776826c |
14 | 2192d01649548 |
15 | dd4193deb065 |
hex | 6d3b3d5e834c |
120101200102220 has 24 divisors (see below), whose sum is σ = 260909503671600. Its totient is φ = 46383911763392.
The previous prime is 120101200102189. The next prime is 120101200102237. The reversal of 120101200102220 is 22201002101021.
It is a junction number, because it is equal to n+sod(n) for n = 120101200102195 and 120101200102204.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103535516750 + ... + 103535517909.
It is an arithmetic number, because the mean of its divisors is an integer number (10871229319650).
Almost surely, 2120101200102220 is an apocalyptic number.
120101200102220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120101200102220 is an abundant number, since it is smaller than the sum of its proper divisors (140808303569380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120101200102220 is a wasteful number, since it uses less digits than its factorization.
120101200102220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207071034697 (or 207071034695 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 120101200102220 its reverse (22201002101021), we get a palindrome (142302202203241).
The spelling of 120101200102220 in words is "one hundred twenty trillion, one hundred one billion, two hundred million, one hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •