Base | Representation |
---|---|
bin | 110011010001111011… |
… | …0000100101001001001 |
3 | 101112020122221020012002 |
4 | 1212203312010221021 |
5 | 3301012444342101 |
6 | 122331223000345 |
7 | 10645644265400 |
oct | 1464366045111 |
9 | 345218836162 |
10 | 110123043401 |
11 | 42780650478 |
12 | 19413b990b5 |
13 | a4ccb4b157 |
14 | 5489692637 |
15 | 2ce7ceed6b |
hex | 19a3d84a49 |
110123043401 has 6 divisors (see below), whose sum is σ = 128102315850. Its totient is φ = 94391180016.
The previous prime is 110123043397. The next prime is 110123043431. The reversal of 110123043401 is 104340321011.
It can be written as a sum of positive squares in only one way, i.e., 109905510400 + 217533001 = 331520^2 + 14749^2 .
It is not a de Polignac number, because 110123043401 - 22 = 110123043397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110123043431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1123704476 + ... + 1123704573.
It is an arithmetic number, because the mean of its divisors is an integer number (21350385975).
Almost surely, 2110123043401 is an apocalyptic number.
It is an amenable number.
110123043401 is a deficient number, since it is larger than the sum of its proper divisors (17979272449).
110123043401 is an equidigital number, since it uses as much as digits as its factorization.
110123043401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2247409063 (or 2247409056 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 110123043401 its reverse (104340321011), we get a palindrome (214463364412).
The spelling of 110123043401 in words is "one hundred ten billion, one hundred twenty-three million, forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •