Base | Representation |
---|---|
bin | 11011010010001110111001… |
… | …010111000011001001101000 |
3 | 120201212220111100012111011102 |
4 | 123102032321113003021220 |
5 | 111212040402441010440 |
6 | 1103115155323220532 |
7 | 34163504564454062 |
oct | 3322167127031150 |
9 | 521786440174142 |
10 | 120000201110120 |
11 | 35265888145221 |
12 | 11560a14677748 |
13 | 51c5c7ccb2346 |
14 | 218c07da60732 |
15 | dd173212db15 |
hex | 6d23b95c3268 |
120000201110120 has 32 divisors (see below), whose sum is σ = 271492167721320. Its totient is φ = 47734886626560.
The previous prime is 120000201110099. The next prime is 120000201110173. The reversal of 120000201110120 is 21011102000021.
It can be written as a sum of positive squares in 4 ways, for example, as 42011838575716 + 77988362534404 = 6481654^2 + 8831102^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8287299467 + ... + 8287313946.
Almost surely, 2120000201110120 is an apocalyptic number.
120000201110120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120000201110120 is an abundant number, since it is smaller than the sum of its proper divisors (151491966611200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120000201110120 is a wasteful number, since it uses less digits than its factorization.
120000201110120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16574613605 (or 16574613601 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120000201110120 its reverse (21011102000021), we get a palindrome (141011303110141).
The spelling of 120000201110120 in words is "one hundred twenty trillion, two hundred one million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •