Base | Representation |
---|---|
bin | 11011010011111110100100… |
… | …100110111000000111110011 |
3 | 120202022101000010201221201222 |
4 | 123103332210212320013303 |
5 | 111221021442134201003 |
6 | 1103250230114215255 |
7 | 34205251232422262 |
oct | 3323764446700763 |
9 | 522271003657658 |
10 | 120120112022003 |
11 | 353017207910a5 |
12 | 115800ba58452b |
13 | 520437c8a6842 |
14 | 2193bb72165d9 |
15 | dd48ee387c38 |
hex | 6d3fa49b81f3 |
120120112022003 has 8 divisors (see below), whose sum is σ = 120679355266176. Its totient is φ = 119561052600000.
The previous prime is 120120112021993. The next prime is 120120112022011. The reversal of 120120112022003 is 300220211021021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120120112022003 - 28 = 120120112021747 is a prime.
It is a super-2 number, since 2×1201201120220032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120120112022803) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44645498 + ... + 47259503.
It is an arithmetic number, because the mean of its divisors is an integer number (15084919408272).
Almost surely, 2120120112022003 is an apocalyptic number.
120120112022003 is a deficient number, since it is larger than the sum of its proper divisors (559243244173).
120120112022003 is an equidigital number, since it uses as much as digits as its factorization.
120120112022003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91911085.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 120120112022003 its reverse (300220211021021), we get a palindrome (420340323043024).
The spelling of 120120112022003 in words is "one hundred twenty trillion, one hundred twenty billion, one hundred twelve million, twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •