Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …100111100110111111000 |
3 | 21002012101012202210220101 |
4 | 131012221330330313320 |
5 | 230232010321320440 |
6 | 4130443055205144 |
7 | 264332066011156 |
oct | 35065174746770 |
9 | 7065335683811 |
10 | 2000011120120 |
11 | 701222156572 |
12 | 2837478167b4 |
13 | 1167a5958a20 |
14 | 6cb301463d6 |
15 | 37058e7769a |
hex | 1d1a9f3cdf8 |
2000011120120 has 32 divisors (see below), whose sum is σ = 4846180792320. Its totient is φ = 738465644160.
The previous prime is 2000011120117. The next prime is 2000011120139. The reversal of 2000011120120 is 210211100002.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 2000011120097 and 2000011120106.
It is a congruent number.
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, 1923087096 + ... + 1923088135.
It is an arithmetic number, because the mean of its divisors is an integer number (151443149760).
Almost surely, 22000011120120 is an apocalyptic number.
2000011120120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2000011120120 is an abundant number, since it is smaller than the sum of its proper divisors (2846169672200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000011120120 is a wasteful number, since it uses less digits than its factorization.
2000011120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3846175255 (or 3846175251 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2000011120120 its reverse (210211100002), we get a palindrome (2210222220122).
The spelling of 2000011120120 in words is "two trillion, eleven million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •