Base | Representation |
---|---|
bin | 11001000001001010101110… |
… | …100101011101001001101011 |
3 | 112102120220021112112012212002 |
4 | 121001022232211131021223 |
5 | 103410223302204240433 |
6 | 1030003421121241215 |
7 | 32114335460626634 |
oct | 3101125645351153 |
9 | 472526245465762 |
10 | 110031401243243 |
11 | 32072067541a97 |
12 | 104109a579320b |
13 | 4951bbba5bb6c |
14 | 1d2579650288b |
15 | cac2813799e8 |
hex | 6412ae95d26b |
110031401243243 has 16 divisors (see below), whose sum is σ = 114972151034400. Its totient is φ = 105168824893440.
The previous prime is 110031401243213. The next prime is 110031401243263. The reversal of 110031401243243 is 342342104130011.
It is a cyclic number.
It is not a de Polignac number, because 110031401243243 - 246 = 39662657065579 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110031401243213) 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 15 ways as a sum of consecutive naturals, for example, 11948438 + ... + 19048043.
It is an arithmetic number, because the mean of its divisors is an integer number (7185759439650).
Almost surely, 2110031401243243 is an apocalyptic number.
110031401243243 is a deficient number, since it is larger than the sum of its proper divisors (4940749791157).
110031401243243 is a wasteful number, since it uses less digits than its factorization.
110031401243243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30997742.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 110031401243243 its reverse (342342104130011), we get a palindrome (452373505373254).
The spelling of 110031401243243 in words is "one hundred ten trillion, thirty-one billion, four hundred one million, two hundred forty-three thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •