Base | Representation |
---|---|
bin | 11001000101010111110011… |
… | …000100011101100110100001 |
3 | 112110121112000022000201000101 |
4 | 121011113303010131212201 |
5 | 103424442000113443243 |
6 | 1030344241355422401 |
7 | 32144244125411155 |
oct | 3105276304354641 |
9 | 473545008021011 |
10 | 110320313031073 |
11 | 32173644730382 |
12 | 10458995754a01 |
13 | 49732125b8b82 |
14 | 1d35762b71065 |
15 | cb4a4037254d |
hex | 6455f311d9a1 |
110320313031073 has 2 divisors, whose sum is σ = 110320313031074. Its totient is φ = 110320313031072.
The previous prime is 110320313031017. The next prime is 110320313031167. The reversal of 110320313031073 is 370130313023011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99408238055424 + 10912074975649 = 9970368^2 + 3303343^2 .
It is a cyclic number.
It is not a de Polignac number, because 110320313031073 - 217 = 110320312900001 is a prime.
It is not a weakly prime, because it can be changed into another prime (110320313031013) 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 as a sum of consecutive naturals, namely, 55160156515536 + 55160156515537.
It is an arithmetic number, because the mean of its divisors is an integer number (55160156515537).
Almost surely, 2110320313031073 is an apocalyptic number.
It is an amenable number.
110320313031073 is a deficient number, since it is larger than the sum of its proper divisors (1).
110320313031073 is an equidigital number, since it uses as much as digits as its factorization.
110320313031073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3402, while the sum is 28.
Adding to 110320313031073 its reverse (370130313023011), we get a palindrome (480450626054084).
The spelling of 110320313031073 in words is "one hundred ten trillion, three hundred twenty billion, three hundred thirteen million, thirty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •