Base | Representation |
---|---|
bin | 11011010100000000100001… |
… | …000111101111011111111110 |
3 | 120202022120101201112122121002 |
4 | 123110000201013233133332 |
5 | 111221040231424342342 |
6 | 1103251213300410302 |
7 | 34205354056512623 |
oct | 3324004107573776 |
9 | 522276351478532 |
10 | 120122201012222 |
11 | 353025a298a3a2 |
12 | 115805a20a6992 |
13 | 520462360b326 |
14 | 2193d3483834a |
15 | dd49c2977d32 |
hex | 6d40211ef7fe |
120122201012222 has 8 divisors (see below), whose sum is σ = 180183404041176. Its totient is φ = 60061066331832.
The previous prime is 120122201012197. The next prime is 120122201012227. The reversal of 120122201012222 is 222210102221021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×1201222010122224 (a number of 57 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120122201012194 and 120122201012203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120122201012227) 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, 12440708 + ... + 19874999.
It is an arithmetic number, because the mean of its divisors is an integer number (22522925505147).
Almost surely, 2120122201012222 is an apocalyptic number.
120122201012222 is a deficient number, since it is larger than the sum of its proper divisors (60061203028954).
120122201012222 is a wasteful number, since it uses less digits than its factorization.
120122201012222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34174282.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 120122201012222 its reverse (222210102221021), we get a palindrome (342332303233243).
The spelling of 120122201012222 in words is "one hundred twenty trillion, one hundred twenty-two billion, two hundred one million, twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •