Base | Representation |
---|---|
bin | 10000000000111011010… |
… | …001100111000101010011 |
3 | 10220012121011101022111002 |
4 | 100000323101213011103 |
5 | 121012314030200201 |
6 | 2201322053012215 |
7 | 142336365335621 |
oct | 20007321470523 |
9 | 3805534338432 |
10 | 1100506100051 |
11 | 3947a40044a6 |
12 | 15935132406b |
13 | 7ca148b7a67 |
14 | 3b39c7aa511 |
15 | 1d96012176b |
hex | 1003b467153 |
1100506100051 has 4 divisors (see below), whose sum is σ = 1110602486400. Its totient is φ = 1090409713704.
The previous prime is 1100506100041. The next prime is 1100506100081. The reversal of 1100506100051 is 1500016050011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1100506100051 - 214 = 1100506083667 is a prime.
It is a super-2 number, since 2×11005061000512 (a number of 25 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 = 1100506099996 and 1100506100032.
It is not an unprimeable number, because it can be changed into a prime (1100506100011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5048193011 + ... + 5048193228.
It is an arithmetic number, because the mean of its divisors is an integer number (277650621600).
Almost surely, 21100506100051 is an apocalyptic number.
1100506100051 is a deficient number, since it is larger than the sum of its proper divisors (10096386349).
1100506100051 is a wasteful number, since it uses less digits than its factorization.
1100506100051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10096386348.
The product of its (nonzero) digits is 150, while the sum is 20.
The spelling of 1100506100051 in words is "one trillion, one hundred billion, five hundred six million, one hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •