Base | Representation |
---|---|
bin | 11011010010011001010000… |
… | …001010111100001011000110 |
3 | 120201220222012022200002221002 |
4 | 123102121100022330023012 |
5 | 111212231141213330042 |
6 | 1103124235002053302 |
7 | 34164350263100525 |
oct | 3322312012741306 |
9 | 521828168602832 |
10 | 120011321230022 |
11 | 3526a574166962 |
12 | 11562bb87aa232 |
13 | 51c7032a76351 |
14 | 218c81687c4bc |
15 | dd1b834e9132 |
hex | 6d26502bc2c6 |
120011321230022 has 8 divisors (see below), whose sum is σ = 180949712321496. Its totient is φ = 59694750456192.
The previous prime is 120011321229983. The next prime is 120011321230027. The reversal of 120011321230022 is 220032123110021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1200113212300222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120011321229976 and 120011321230003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120011321230027) 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, 155455078928 + ... + 155455079699.
It is an arithmetic number, because the mean of its divisors is an integer number (22618714040187).
Almost surely, 2120011321230022 is an apocalyptic number.
120011321230022 is a deficient number, since it is larger than the sum of its proper divisors (60938391091474).
120011321230022 is a wasteful number, since it uses less digits than its factorization.
120011321230022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310910158822.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 120011321230022 its reverse (220032123110021), we get a palindrome (340043444340043).
The spelling of 120011321230022 in words is "one hundred twenty trillion, eleven billion, three hundred twenty-one million, two hundred thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •