Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …001111000111011001010 |
3 | 10220020212122210222010122 |
4 | 100001120301320323022 |
5 | 121014322240213002 |
6 | 2201443134343242 |
7 | 142354555642235 |
oct | 20013061707312 |
9 | 3806778728118 |
10 | 1101001101002 |
11 | 394a28466aa0 |
12 | 15946b05ab22 |
13 | 7ca9330c62a |
14 | 3b40842041c |
15 | 1d98d7ed6a2 |
hex | 10058c78eca |
1101001101002 has 16 divisors (see below), whose sum is σ = 1801785786624. Its totient is φ = 500414040000.
The previous prime is 1101001100977. The next prime is 1101001101023. The reversal of 1101001101002 is 2001011001011.
It is a happy number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1774874 + ... + 2313477.
It is an arithmetic number, because the mean of its divisors is an integer number (112611611664).
Almost surely, 21101001101002 is an apocalyptic number.
1101001101002 is a deficient number, since it is larger than the sum of its proper divisors (700784685622).
1101001101002 is a wasteful number, since it uses less digits than its factorization.
1101001101002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4100605.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1101001101002 its reverse (2001011001011), we get a palindrome (3102012102013).
Subtracting 1101001101002 from its reverse (2001011001011), we obtain a palindrome (900009900009).
The spelling of 1101001101002 in words is "one trillion, one hundred one billion, one million, one hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •