Base | Representation |
---|---|
bin | 1010011010101101111110… |
… | …0101110010001000111101 |
3 | 1111120000010021221221211200 |
4 | 2212223133211302020331 |
5 | 3000131031303110010 |
6 | 40205542340010113 |
7 | 2261351055611304 |
oct | 246533745621075 |
9 | 44500107857750 |
10 | 11454134035005 |
11 | 3716742066012 |
12 | 134ba7a390939 |
13 | 651174122a6c |
14 | 2b855110d43b |
15 | 14ce35846cc0 |
hex | a6adf97223d |
11454134035005 has 48 divisors (see below), whose sum is σ = 20616676110576. Its totient is φ = 5878232432640.
The previous prime is 11454134034997. The next prime is 11454134035051. The reversal of 11454134035005 is 50053043145411.
11454134035005 is a `hidden beast` number, since 1 + 14 + 5 + 4 + 134 + 0 + 3 + 500 + 5 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 1113368956569 + 10340765078436 = 1055163^2 + 3215706^2 .
It is not a de Polignac number, because 11454134035005 - 23 = 11454134034997 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 42387252 + ... + 42656621.
It is an arithmetic number, because the mean of its divisors is an integer number (429514085637).
Almost surely, 211454134035005 is an apocalyptic number.
11454134035005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11454134035005 is a deficient number, since it is larger than the sum of its proper divisors (9162542075571).
11454134035005 is a wasteful number, since it uses less digits than its factorization.
11454134035005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85043998 (or 85043995 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 11454134035005 in words is "eleven trillion, four hundred fifty-four billion, one hundred thirty-four million, thirty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •