Base | Representation |
---|---|
bin | 10000000000111001000… |
… | …010101111111010101001 |
3 | 10220012111112220122011212 |
4 | 100000321002233322221 |
5 | 121012224433242031 |
6 | 2201314234202505 |
7 | 142335432120014 |
oct | 20007102577251 |
9 | 3805445818155 |
10 | 1100468649641 |
11 | 394784955449 |
12 | 159340883435 |
13 | 7ca09c0485a |
14 | 3b39781c37b |
15 | 1d95bbc512b |
hex | 100390afea9 |
1100468649641 has 8 divisors (see below), whose sum is σ = 1111672021824. Its totient is φ = 1089275262480.
The previous prime is 1100468649617. The next prime is 1100468649659. The reversal of 1100468649641 is 1469468640011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100468649641 is a prime.
It is a super-2 number, since 2×11004686496412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1100468649641.
It is not an unprimeable number, because it can be changed into a prime (1100468649601) 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, 2274611 + ... + 2715656.
It is an arithmetic number, because the mean of its divisors is an integer number (138959002728).
Almost surely, 21100468649641 is an apocalyptic number.
It is an amenable number.
1100468649641 is a deficient number, since it is larger than the sum of its proper divisors (11203372183).
1100468649641 is a wasteful number, since it uses less digits than its factorization.
1100468649641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4992511.
The product of its (nonzero) digits is 995328, while the sum is 50.
The spelling of 1100468649641 in words is "one trillion, one hundred billion, four hundred sixty-eight million, six hundred forty-nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •