Base | Representation |
---|---|
bin | 11011010011101100111110… |
… | …100011100010000111011111 |
3 | 120202020120020112001210212121 |
4 | 123103230332203202013133 |
5 | 111220214244310001343 |
6 | 1103233423324443411 |
7 | 34204012123040500 |
oct | 3323547643420737 |
9 | 522216215053777 |
10 | 120101220000223 |
11 | 352a4706726560 |
12 | 115785076a9567 |
13 | 520265b914127 |
14 | 2192d04148ba7 |
15 | dd4195a2baed |
hex | 6d3b3e8e21df |
120101220000223 has 144 divisors (see below), whose sum is σ = 165891282249600. Its totient is φ = 85739256086400.
The previous prime is 120101220000221. The next prime is 120101220000227. The reversal of 120101220000223 is 322000022101021.
It is a happy number.
It is not a de Polignac number, because 120101220000223 - 21 = 120101220000221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120101220000197 and 120101220000206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120101220000221) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 17586937573 + ... + 17586944401.
It is an arithmetic number, because the mean of its divisors is an integer number (1152022793400).
Almost surely, 2120101220000223 is an apocalyptic number.
120101220000223 is a deficient number, since it is larger than the sum of its proper divisors (45790062249377).
120101220000223 is a wasteful number, since it uses less digits than its factorization.
120101220000223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8722 (or 8684 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 120101220000223 its reverse (322000022101021), we get a palindrome (442101242101244).
The spelling of 120101220000223 in words is "one hundred twenty trillion, one hundred one billion, two hundred twenty million, two hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •