Base | Representation |
---|---|
bin | 11001000001010110100101… |
… | …011101010000111101110010 |
3 | 112102122010010211120122001021 |
4 | 121001112211131100331302 |
5 | 103410430341022044442 |
6 | 1030013324331130054 |
7 | 32115266126043253 |
oct | 3101264535207562 |
9 | 472563124518037 |
10 | 110044133003122 |
11 | 3207750026569a |
12 | 104133595a392a |
13 | 495316a6a2aa6 |
14 | 1d262433a4b2a |
15 | cac778e92e67 |
hex | 6415a5750f72 |
110044133003122 has 8 divisors (see below), whose sum is σ = 165269733661872. Its totient is φ = 54954221782500.
The previous prime is 110044133003059. The next prime is 110044133003137. The reversal of 110044133003122 is 221300331440011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1100441330031222 (a number of 29 digits) contains 22 as substring.
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, 33922357504 + ... + 33922360747.
It is an arithmetic number, because the mean of its divisors is an integer number (20658716707734).
Almost surely, 2110044133003122 is an apocalyptic number.
110044133003122 is a deficient number, since it is larger than the sum of its proper divisors (55225600658750).
110044133003122 is an equidigital number, since it uses as much as digits as its factorization.
110044133003122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67844719064.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 110044133003122 its reverse (221300331440011), we get a palindrome (331344464443133).
The spelling of 110044133003122 in words is "one hundred ten trillion, forty-four billion, one hundred thirty-three million, three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •