Base | Representation |
---|---|
bin | 11011010010100011011001… |
… | …001100110001000100000001 |
3 | 120201222000022012001010121000 |
4 | 123102203121030301010001 |
5 | 111212420441242400420 |
6 | 1103133235300522213 |
7 | 34165214153125323 |
oct | 3322433114610401 |
9 | 521860265033530 |
10 | 120022210121985 |
11 | 35274151706626 |
12 | 115651373b0369 |
13 | 51c807996b1a2 |
14 | 218d16aaa9613 |
15 | dd20be43c690 |
hex | 6d28d9331101 |
120022210121985 has 64 divisors (see below), whose sum is σ = 218603742336000. Its totient is φ = 62442949662720.
The previous prime is 120022210121951. The next prime is 120022210121993. The reversal of 120022210121985 is 589121012220021.
120022210121985 is a `hidden beast` number, since 1 + 200 + 22 + 210 + 1 + 219 + 8 + 5 = 666.
It is not a de Polignac number, because 120022210121985 - 26 = 120022210121921 is a prime.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 44116056 + ... + 46757574.
It is an arithmetic number, because the mean of its divisors is an integer number (3415683474000).
Almost surely, 2120022210121985 is an apocalyptic number.
120022210121985 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
120022210121985 is a deficient number, since it is larger than the sum of its proper divisors (98581532214015).
120022210121985 is a wasteful number, since it uses less digits than its factorization.
120022210121985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2649783 (or 2649777 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 36.
The spelling of 120022210121985 in words is "one hundred twenty trillion, twenty-two billion, two hundred ten million, one hundred twenty-one thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •