Base | Representation |
---|---|
bin | 11001000111000010010001… |
… | …110111110010000011011011 |
3 | 112111000110010101111100200120 |
4 | 121013002101313302003123 |
5 | 103433330123441342021 |
6 | 1030512550505204323 |
7 | 32155432326325344 |
oct | 3107022167620333 |
9 | 474013111440616 |
10 | 110434646434011 |
11 | 32208085983229 |
12 | 10476b837906a3 |
13 | 4980c337cc113 |
14 | 1d3b0cb6950cb |
15 | cb79d2aeb2c6 |
hex | 647091df20db |
110434646434011 has 8 divisors (see below), whose sum is σ = 147468958024464. Its totient is φ = 73511716233120.
The previous prime is 110434646433959. The next prime is 110434646434067.
110434646434011 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110434646434011 - 218 = 110434646171867 is a prime.
It is a super-2 number, since 2×1104346464340112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110434646434111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27845345076 + ... + 27845349041.
It is an arithmetic number, because the mean of its divisors is an integer number (18433619753058).
Almost surely, 2110434646434011 is an apocalyptic number.
110434646434011 is a deficient number, since it is larger than the sum of its proper divisors (37034311590453).
110434646434011 is an equidigital number, since it uses as much as digits as its factorization.
110434646434011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55690694781.
The product of its (nonzero) digits is 331776, while the sum is 42.
The spelling of 110434646434011 in words is "one hundred ten trillion, four hundred thirty-four billion, six hundred forty-six million, four hundred thirty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •