Base | Representation |
---|---|
bin | 11001000010100111100000… |
… | …111111010010000001111011 |
3 | 112102221102102220201110021012 |
4 | 121002213200333102001323 |
5 | 103413341322431401133 |
6 | 1030121255223304135 |
7 | 32124463421625611 |
oct | 3102474077220173 |
9 | 472842386643235 |
10 | 110131031122043 |
11 | 32100342a5a5a8 |
12 | 1042816b5ab04b |
13 | 495b40898ba79 |
14 | 1d2a5283396b1 |
15 | caeb62d53b48 |
hex | 6429e0fd207b |
110131031122043 has 4 divisors (see below), whose sum is σ = 110131095179400. Its totient is φ = 110130967064688.
The previous prime is 110131031122037. The next prime is 110131031122081. The reversal of 110131031122043 is 340221130131011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110131031122043 - 24 = 110131031122027 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110131031122643) by changing a digit.
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, 29376593 + ... + 32912706.
It is an arithmetic number, because the mean of its divisors is an integer number (27532773794850).
Almost surely, 2110131031122043 is an apocalyptic number.
110131031122043 is a deficient number, since it is larger than the sum of its proper divisors (64057357).
110131031122043 is an equidigital number, since it uses as much as digits as its factorization.
110131031122043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64057356.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 110131031122043 its reverse (340221130131011), we get a palindrome (450352161253054).
The spelling of 110131031122043 in words is "one hundred ten trillion, one hundred thirty-one billion, thirty-one million, one hundred twenty-two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •