Base | Representation |
---|---|
bin | 110011001111111011… |
… | …0100100110000110001 |
3 | 101112001222220102121012 |
4 | 1212133312210300301 |
5 | 3300343323103342 |
6 | 122320431240305 |
7 | 10644202061315 |
oct | 1463766446061 |
9 | 345058812535 |
10 | 110056066097 |
11 | 4274686442a |
12 | 193b5679095 |
13 | a4bbcca403 |
14 | 5480819b45 |
15 | 2ce1ebeb82 |
hex | 199fda4c31 |
110056066097 has 8 divisors (see below), whose sum is σ = 118728631656. Its totient is φ = 101627798272.
The previous prime is 110056066091. The next prime is 110056066139. The reversal of 110056066097 is 790660650011.
It can be written as a sum of positive squares in 4 ways, for example, as 46332132001 + 63723934096 = 215249^2 + 252436^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110056066097 is a prime.
It is a super-2 number, since 2×1100560660972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110056066091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61073498 + ... + 61075299.
It is an arithmetic number, because the mean of its divisors is an integer number (14841078957).
Almost surely, 2110056066097 is an apocalyptic number.
110056066097 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
110056066097 is a deficient number, since it is larger than the sum of its proper divisors (8672565559).
110056066097 is a wasteful number, since it uses less digits than its factorization.
110056066097 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122148867.
The product of its (nonzero) digits is 68040, while the sum is 41.
The spelling of 110056066097 in words is "one hundred ten billion, fifty-six million, sixty-six thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •