Base | Representation |
---|---|
bin | 11101001000100000101… |
… | …00001010011100101110 |
3 | 10112200202111011122000122 |
4 | 32210100110022130232 |
5 | 112400022240213402 |
6 | 2043504211324542 |
7 | 132214511654102 |
oct | 16442024123456 |
9 | 3480674148018 |
10 | 1001001101102 |
11 | 356582030a82 |
12 | 1420012b0752 |
13 | 735177ccc62 |
14 | 3663d39d902 |
15 | 1b0895b3ca2 |
hex | e91050a72e |
1001001101102 has 4 divisors (see below), whose sum is σ = 1501501651656. Its totient is φ = 500500550550.
The previous prime is 1001001101071. The next prime is 1001001101147. The reversal of 1001001101102 is 2011011001001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×10010011011022 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1001001101102.
It is a congruent 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 as a sum of consecutive naturals, namely, 250250275274 + ... + 250250275277.
It is an arithmetic number, because the mean of its divisors is an integer number (375375412914).
Almost surely, 21001001101102 is an apocalyptic number.
1001001101102 is a deficient number, since it is larger than the sum of its proper divisors (500500550554).
1001001101102 is an equidigital number, since it uses as much as digits as its factorization.
1001001101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500500550553.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1001001101102 its reverse (2011011001001), we get a palindrome (3012012102103).
The spelling of 1001001101102 in words is "one trillion, one billion, one million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •