Base | Representation |
---|---|
bin | 110011001110011001… |
… | …1110010101011111011 |
3 | 101111221102211021000100 |
4 | 1212130303302223323 |
5 | 3300242240130201 |
6 | 122311405010443 |
7 | 10643012054304 |
oct | 1463463625373 |
9 | 344842737010 |
10 | 110005005051 |
11 | 4271aa59517 |
12 | 193a0553a23 |
13 | a4b1560086 |
14 | 5477b277ab |
15 | 2cdc785886 |
hex | 199ccf2afb |
110005005051 has 12 divisors (see below), whose sum is σ = 158899886080. Its totient is φ = 73334931120.
The previous prime is 110005005043. The next prime is 110005005083. The reversal of 110005005051 is 150500500011.
110005005051 is a `hidden beast` number, since 110 + 0 + 0 + 50 + 0 + 505 + 1 = 666.
It is not a de Polignac number, because 110005005051 - 23 = 110005005043 is a prime.
It is a super-2 number, since 2×1100050050512 (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 (110005005001) 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 11 ways as a sum of consecutive naturals, for example, 341766 + ... + 580356.
Almost surely, 2110005005051 is an apocalyptic number.
110005005051 is a deficient number, since it is larger than the sum of its proper divisors (48894881029).
110005005051 is a wasteful number, since it uses less digits than its factorization.
110005005051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289826 (or 289823 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 18.
Adding to 110005005051 its reverse (150500500011), we get a palindrome (260505505062).
The spelling of 110005005051 in words is "one hundred ten billion, five million, five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •