Base | Representation |
---|---|
bin | 11011010010100010010001… |
… | …101011000101011001000110 |
3 | 120201221220012120000012122111 |
4 | 123102202101223011121012 |
5 | 111212411012042010042 |
6 | 1103132520232251234 |
7 | 34165142342160220 |
oct | 3322422153053106 |
9 | 521856176005574 |
10 | 120021010110022 |
11 | 352736962a18aa |
12 | 11564a61540b1a |
13 | 51c7c18171438 |
14 | 218d095575410 |
15 | dd204dded517 |
hex | 6d2891ac5646 |
120021010110022 has 8 divisors (see below), whose sum is σ = 205750303045776. Its totient is φ = 51437575761432.
The previous prime is 120021010110011. The next prime is 120021010110059. The reversal of 120021010110022 is 220011010120021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1200210101100223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120021010109984 and 120021010110011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4286464646773 + ... + 4286464646800.
It is an arithmetic number, because the mean of its divisors is an integer number (25718787880722).
Almost surely, 2120021010110022 is an apocalyptic number.
120021010110022 is a deficient number, since it is larger than the sum of its proper divisors (85729292935754).
120021010110022 is an equidigital number, since it uses as much as digits as its factorization.
120021010110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8572929293582.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120021010110022 its reverse (220011010120021), we get a palindrome (340032020230043).
Subtracting 120021010110022 from its reverse (220011010120021), we obtain a palindrome (99990000009999).
The spelling of 120021010110022 in words is "one hundred twenty trillion, twenty-one billion, ten million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •