Base | Representation |
---|---|
bin | 110011010010100011… |
… | …1010000101101000101 |
3 | 101112022010222112001212 |
4 | 1212211013100231011 |
5 | 3301033421421334 |
6 | 122333303101205 |
7 | 10646323220222 |
oct | 1464507205505 |
9 | 345263875055 |
10 | 110144326469 |
11 | 42791667791 |
12 | 1941b141805 |
13 | a504390598 |
14 | 548c432949 |
15 | 2ce9b05ece |
hex | 19a51d0b45 |
110144326469 has 4 divisors (see below), whose sum is σ = 112011179520. Its totient is φ = 108277473420.
The previous prime is 110144326433. The next prime is 110144326471. The reversal of 110144326469 is 964623441011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110144326469 - 28 = 110144326213 is a prime.
It is a super-2 number, since 2×1101443264692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110144329469) 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 3 ways as a sum of consecutive naturals, for example, 933426437 + ... + 933426554.
It is an arithmetic number, because the mean of its divisors is an integer number (28002794880).
Almost surely, 2110144326469 is an apocalyptic number.
It is an amenable number.
110144326469 is a deficient number, since it is larger than the sum of its proper divisors (1866853051).
110144326469 is an equidigital number, since it uses as much as digits as its factorization.
110144326469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1866853050.
The product of its (nonzero) digits is 124416, while the sum is 41.
The spelling of 110144326469 in words is "one hundred ten billion, one hundred forty-four million, three hundred twenty-six thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •