Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …001111011010111011010 |
3 | 10220020212122211110212000 |
4 | 100001120301323113122 |
5 | 121014322241023002 |
6 | 2201443134501430 |
7 | 142354556013342 |
oct | 20013061732732 |
9 | 3806778743760 |
10 | 1101001111002 |
11 | 394a28473561 |
12 | 15946b064876 |
13 | 7ca93314050 |
14 | 3b408423d22 |
15 | 1d98d80161c |
hex | 10058c7b5da |
1101001111002 has 64 divisors (see below), whose sum is σ = 2635032072960. Its totient is φ = 338749307712.
The previous prime is 1101001110997. The next prime is 1101001111003. The reversal of 1101001111002 is 2001111001011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1101001111003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15244408 + ... + 15316460.
It is an arithmetic number, because the mean of its divisors is an integer number (41172376140).
Almost surely, 21101001111002 is an apocalyptic number.
1101001111002 is an abundant number, since it is smaller than the sum of its proper divisors (1534030961958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101001111002 is a wasteful number, since it uses less digits than its factorization.
1101001111002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93844 (or 93838 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1101001111002 its reverse (2001111001011), we get a palindrome (3102112112013).
The spelling of 1101001111002 in words is "one trillion, one hundred one billion, one million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •