Base | Representation |
---|---|
bin | 11011010100000000010101… |
… | …101111111000111011100110 |
3 | 120202022112220102111220011221 |
4 | 123110000111233320323212 |
5 | 111221034334103210042 |
6 | 1103251142323050554 |
7 | 34205346251644162 |
oct | 3324002557707346 |
9 | 522275812456157 |
10 | 120122010210022 |
11 | 35302505209927 |
12 | 1158054a210a5a |
13 | 52045c2c24712 |
14 | 2193d1736bca2 |
15 | dd49b0d38d67 |
hex | 6d4015bf8ee6 |
120122010210022 has 8 divisors (see below), whose sum is σ = 185995370647872. Its totient is φ = 58123553327400.
The previous prime is 120122010210011. The next prime is 120122010210023. The reversal of 120122010210022 is 220012010221021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1201220102100222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120122010209978 and 120122010210005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120122010210023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 968725888729 + ... + 968725888852.
It is an arithmetic number, because the mean of its divisors is an integer number (23249421330984).
Almost surely, 2120122010210022 is an apocalyptic number.
120122010210022 is a deficient number, since it is larger than the sum of its proper divisors (65873360437850).
120122010210022 is a wasteful number, since it uses less digits than its factorization.
120122010210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1937451777614.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 120122010210022 its reverse (220012010221021), we get a palindrome (340134020431043).
The spelling of 120122010210022 in words is "one hundred twenty trillion, one hundred twenty-two billion, ten million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •