Base | Representation |
---|---|
bin | 11001000010011111000111… |
… | …010011010001011001011010 |
3 | 112102220120011020022011012122 |
4 | 121002133013103101121122 |
5 | 103413214334104020442 |
6 | 1030113204134141242 |
7 | 32124024033341165 |
oct | 3102370723213132 |
9 | 472816136264178 |
10 | 110122010220122 |
11 | 320a753399245a |
12 | 104264724b1822 |
13 | 495a5cbaa0994 |
14 | 1d29d10242adc |
15 | cae7d5de8dd2 |
hex | 6427c74d165a |
110122010220122 has 8 divisors (see below), whose sum is σ = 174899663290836. Its totient is φ = 51822122456512.
The previous prime is 110122010220097. The next prime is 110122010220151. The reversal of 110122010220122 is 221022010221011.
It can be written as a sum of positive squares in 2 ways, for example, as 97840763319601 + 12281246900521 = 9891449^2 + 3504461^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 110122010220122.
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, 1619441326733 + ... + 1619441326800.
Almost surely, 2110122010220122 is an apocalyptic number.
110122010220122 is a deficient number, since it is larger than the sum of its proper divisors (64777653070714).
110122010220122 is a wasteful number, since it uses less digits than its factorization.
110122010220122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3238882653552.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 110122010220122 its reverse (221022010221011), we get a palindrome (331144020441133).
The spelling of 110122010220122 in words is "one hundred ten trillion, one hundred twenty-two billion, ten million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •