Base | Representation |
---|---|
bin | 10000000000100000000… |
… | …111110111010000110100 |
3 | 10220011102102012111002021 |
4 | 100000200013313100310 |
5 | 121010400420410202 |
6 | 2201204541122524 |
7 | 142322164323643 |
oct | 20004007672064 |
9 | 3804372174067 |
10 | 1100050560052 |
11 | 39458a954564 |
12 | 159244859444 |
13 | 7c9713cb572 |
14 | 3b3580a935a |
15 | 1d93513ba37 |
hex | 100201f7434 |
1100050560052 has 12 divisors (see below), whose sum is σ = 1969857979936. Its totient is φ = 537233994360.
The previous prime is 1100050560023. The next prime is 1100050560053. The reversal of 1100050560052 is 2500650500011.
It is a super-2 number, since 2×11000505600522 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100050559999 and 1100050560026.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 3197821224 + ... + 3197821567.
Almost surely, 21100050560052 is an apocalyptic number.
It is an amenable number.
1100050560052 is a deficient number, since it is larger than the sum of its proper divisors (869807419884).
1100050560052 is a wasteful number, since it uses less digits than its factorization.
1100050560052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6395642838 (or 6395642836 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The spelling of 1100050560052 in words is "one trillion, one hundred billion, fifty million, five hundred sixty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •