Base | Representation |
---|---|
bin | 11001000010110110110011… |
… | …000100111001001100000001 |
3 | 112102222222210112020220122222 |
4 | 121002312303010321030001 |
5 | 103414123424310213101 |
6 | 1030133011413540425 |
7 | 32125614156054233 |
oct | 3102666304711401 |
9 | 472888715226588 |
10 | 110147440710401 |
11 | 321072a381a176 |
12 | 1042b38b044715 |
13 | 495cb22562973 |
14 | 1d2b24384a253 |
15 | cb02c37a401b |
hex | 642db3139301 |
110147440710401 has 4 divisors (see below), whose sum is σ = 110147528257092. Its totient is φ = 110147353163712.
The previous prime is 110147440710347. The next prime is 110147440710409. The reversal of 110147440710401 is 104017044741011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 63345696918001 + 46801743792400 = 7959001^2 + 6841180^2 .
It is a cyclic number.
It is not a de Polignac number, because 110147440710401 - 222 = 110147436516097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110147440710409) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41858180 + ... + 44411733.
It is an arithmetic number, because the mean of its divisors is an integer number (27536882064273).
Almost surely, 2110147440710401 is an apocalyptic number.
It is an amenable number.
110147440710401 is a deficient number, since it is larger than the sum of its proper divisors (87546691).
110147440710401 is an equidigital number, since it uses as much as digits as its factorization.
110147440710401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87546690.
The product of its (nonzero) digits is 12544, while the sum is 35.
The spelling of 110147440710401 in words is "one hundred ten trillion, one hundred forty-seven billion, four hundred forty million, seven hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •