Base | Representation |
---|---|
bin | 110011011000001001… |
… | …1001110001100110111 |
3 | 101112210020010220021121 |
4 | 1212300103032030313 |
5 | 3301424443330234 |
6 | 122404045524411 |
7 | 10654062423325 |
oct | 1466023161467 |
9 | 345706126247 |
10 | 110332011319 |
11 | 428785a9132 |
12 | 19471b73707 |
13 | a5342252ca |
14 | 54a932ad15 |
15 | 2d0b32b4b4 |
hex | 19b04ce337 |
110332011319 has 8 divisors (see below), whose sum is σ = 110454645168. Its totient is φ = 110209419840.
The previous prime is 110332011311. The next prime is 110332011367. The reversal of 110332011319 is 913110233011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110332011319 - 23 = 110332011311 is a prime.
It is a super-2 number, since 2×1103320113192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110332011293 and 110332011302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110332011311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10406329 + ... + 10416925.
It is an arithmetic number, because the mean of its divisors is an integer number (13806830646).
Almost surely, 2110332011319 is an apocalyptic number.
110332011319 is a deficient number, since it is larger than the sum of its proper divisors (122633849).
110332011319 is a wasteful number, since it uses less digits than its factorization.
110332011319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21185.
The product of its (nonzero) digits is 486, while the sum is 25.
The spelling of 110332011319 in words is "one hundred ten billion, three hundred thirty-two million, eleven thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •