Base | Representation |
---|---|
bin | 11001000010011111000111… |
… | …011010100001101110011011 |
3 | 112102220120011100212210002222 |
4 | 121002133013122201232123 |
5 | 103413214340100401021 |
6 | 1030113204243014255 |
7 | 32124024055452101 |
oct | 3102370732415633 |
9 | 472816140783088 |
10 | 110122012122011 |
11 | 320a7534a7136a |
12 | 1042647306a38b |
13 | 495a5cc2b8566 |
14 | 1d29d105b9c71 |
15 | cae7d61726ab |
hex | 6427c76a1b9b |
110122012122011 has 8 divisors (see below), whose sum is σ = 113246784514800. Its totient is φ = 107039182983040.
The previous prime is 110122012122007. The next prime is 110122012122079. The reversal of 110122012122011 is 110221210221011.
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 110122012122011 - 22 = 110122012122007 is a prime.
It is a super-3 number, since 3×1101220121220113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110122012182011) 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, 10485808130 + ... + 10485818631.
It is an arithmetic number, because the mean of its divisors is an integer number (14155848064350).
Almost surely, 2110122012122011 is an apocalyptic number.
110122012122011 is a deficient number, since it is larger than the sum of its proper divisors (3124772392789).
110122012122011 is an equidigital number, since it uses as much as digits as its factorization.
110122012122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20971626909.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 110122012122011 its reverse (110221210221011), we get a palindrome (220343222343022).
The spelling of 110122012122011 in words is "one hundred ten trillion, one hundred twenty-two billion, twelve million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •