Base | Representation |
---|---|
bin | 110011101011010011… |
… | …1100001111110011001 |
3 | 101121110000210110210012 |
4 | 1213112213201332121 |
5 | 3304234031310101 |
6 | 122551532331305 |
7 | 11006026553204 |
oct | 1472647417631 |
9 | 347400713705 |
10 | 110974869401 |
11 | 43078469a00 |
12 | 19611313b35 |
13 | a6074785c6 |
14 | 552a86c93b |
15 | 2d479b2bbb |
hex | 19d69e1f99 |
110974869401 has 6 divisors (see below), whose sum is σ = 121980641706. Its totient is φ = 100886244800.
The previous prime is 110974869349. The next prime is 110974869403. The reversal of 110974869401 is 104968479011.
It can be written as a sum of positive squares in only one way, i.e., 90901647001 + 20073222400 = 301499^2 + 141680^2 .
It is not a de Polignac number, because 110974869401 - 230 = 109901127577 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110974869401.
It is not an unprimeable number, because it can be changed into a prime (110974869403) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 458573720 + ... + 458573961.
It is an arithmetic number, because the mean of its divisors is an integer number (20330106951).
Almost surely, 2110974869401 is an apocalyptic number.
110974869401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110974869401 is a deficient number, since it is larger than the sum of its proper divisors (11005772305).
110974869401 is an equidigital number, since it uses as much as digits as its factorization.
110974869401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 917147703 (or 917147692 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 50.
The spelling of 110974869401 in words is "one hundred ten billion, nine hundred seventy-four million, eight hundred sixty-nine thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •