Base | Representation |
---|---|
bin | 110111111011010010… |
… | …1000010110111110110 |
3 | 102111000001021010022021 |
4 | 1233312211002313312 |
5 | 3431431330220342 |
6 | 131101301423354 |
7 | 11451133565515 |
oct | 1576645026766 |
9 | 374001233267 |
10 | 120101023222 |
11 | 46a30995394 |
12 | 1b33970ab5a |
13 | b4300c881b |
14 | 5b5492267c |
15 | 31cdcad567 |
hex | 1bf6942df6 |
120101023222 has 8 divisors (see below), whose sum is σ = 180303308856. Its totient is φ = 59999920272.
The previous prime is 120101023201. The next prime is 120101023271. The reversal of 120101023222 is 222320101021.
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×1201010232222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120101023196 and 120101023205.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 25292703 + ... + 25297450.
It is an arithmetic number, because the mean of its divisors is an integer number (22537913607).
Almost surely, 2120101023222 is an apocalyptic number.
120101023222 is a deficient number, since it is larger than the sum of its proper divisors (60202285634).
120101023222 is a wasteful number, since it uses less digits than its factorization.
120101023222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50591342.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 120101023222 its reverse (222320101021), we get a palindrome (342421124243).
The spelling of 120101023222 in words is "one hundred twenty billion, one hundred one million, twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •