Base | Representation |
---|---|
bin | 11011010100000000011011… |
… | …101100100100001111000000 |
3 | 120202022120011101021212012021 |
4 | 123110000123230210033000 |
5 | 111221040040130031422 |
6 | 1103251200250011224 |
7 | 34205351603112211 |
oct | 3324003354441700 |
9 | 522276141255167 |
10 | 120122110002112 |
11 | 35302556579129 |
12 | 11580577716b14 |
13 | 520460a7c46aa |
14 | 2193d26707408 |
15 | dd49b999bdc7 |
hex | 6d401bb243c0 |
120122110002112 has 28 divisors (see below), whose sum is σ = 238526329779000. Its totient is φ = 60020987538176.
The previous prime is 120122110002073. The next prime is 120122110002113. The reversal of 120122110002112 is 211200011221021.
It is a super-2 number, since 2×1201221100021122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120122110002113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 625957423 + ... + 626149294.
Almost surely, 2120122110002112 is an apocalyptic number.
It is an amenable number.
120122110002112 is a deficient number, since it is larger than the sum of its proper divisors (118404219776888).
120122110002112 is a wasteful number, since it uses less digits than its factorization.
120122110002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252108228 (or 1252108218 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 120122110002112 its reverse (211200011221021), we get a palindrome (331322121223133).
The spelling of 120122110002112 in words is "one hundred twenty trillion, one hundred twenty-two billion, one hundred ten million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •