Base | Representation |
---|---|
bin | 11011010010011000001110… |
… | …000011101000111100110110 |
3 | 120201220212100000111101212020 |
4 | 123102120032003220330312 |
5 | 111212221403234120042 |
6 | 1103123532535534010 |
7 | 34164310634005242 |
oct | 3322301603507466 |
9 | 521825300441766 |
10 | 120010212020022 |
11 | 3526a055030a85 |
12 | 1156294922a306 |
13 | 51c6bb701c57c |
14 | 218c74d423422 |
15 | dd1b1ae443ec |
hex | 6d260e0e8f36 |
120010212020022 has 16 divisors (see below), whose sum is σ = 240049834801392. Its totient is φ = 39998502213120.
The previous prime is 120010212020003. The next prime is 120010212020029. The reversal of 120010212020022 is 220020212010021.
It is a junction number, because it is equal to n+sod(n) for n = 120010212019983 and 120010212020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120010212020029) by changing a digit.
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, 1225395343 + ... + 1225493274.
It is an arithmetic number, because the mean of its divisors is an integer number (15003114675087).
Almost surely, 2120010212020022 is an apocalyptic number.
120010212020022 is an abundant number, since it is smaller than the sum of its proper divisors (120039622781370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120010212020022 is a wasteful number, since it uses less digits than its factorization.
120010212020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2450896783.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 120010212020022 its reverse (220020212010021), we get a palindrome (340030424030043).
The spelling of 120010212020022 in words is "one hundred twenty trillion, ten billion, two hundred twelve million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •