Base | Representation |
---|---|
bin | 10000000000100000000… |
… | …111110111010000110011 |
3 | 10220011102102012111002020 |
4 | 100000200013313100303 |
5 | 121010400420410201 |
6 | 2201204541122523 |
7 | 142322164323642 |
oct | 20004007672063 |
9 | 3804372174066 |
10 | 1100050560051 |
11 | 39458a954563 |
12 | 159244859443 |
13 | 7c9713cb571 |
14 | 3b3580a9359 |
15 | 1d93513ba36 |
hex | 100201f7433 |
1100050560051 has 8 divisors (see below), whose sum is σ = 1466853482640. Its totient is φ = 733307338752.
The previous prime is 1100050560023. The next prime is 1100050560053. The reversal of 1100050560051 is 1500650500011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100050560051 - 25 = 1100050560019 is a prime.
It is a super-3 number, since 3×11000505600513 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (1100050560053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14882310 + ... + 14956043.
It is an arithmetic number, because the mean of its divisors is an integer number (183356685330).
Almost surely, 21100050560051 is an apocalyptic number.
1100050560051 is a deficient number, since it is larger than the sum of its proper divisors (366802922589).
1100050560051 is a wasteful number, since it uses less digits than its factorization.
1100050560051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29850645.
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 1100050560051 in words is "one trillion, one hundred billion, fifty million, five hundred sixty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •