Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …001011000001001011010 |
3 | 10220011022122222021011100 |
4 | 100000131301120021122 |
5 | 121010310321023002 |
6 | 2201201011412230 |
7 | 142321205112066 |
oct | 20003561301132 |
9 | 3804278867140 |
10 | 1100011111002 |
11 | 39456a65a941 |
12 | 1592335b4076 |
13 | 7c96619872b |
14 | 3b352b5aaa6 |
15 | 1d93194811c |
hex | 1001dc5825a |
1100011111002 has 12 divisors (see below), whose sum is σ = 2383357407210. Its totient is φ = 366670370328.
The previous prime is 1100011110977. The next prime is 1100011111033. The reversal of 1100011111002 is 2001111100011.
It can be written as a sum of positive squares in only one way, i.e., 774313762401 + 325697348601 = 879951^2 + 570699^2 .
It is a super-3 number, since 3×11000111110023 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 30555864177 + ... + 30555864212.
Almost surely, 21100011111002 is an apocalyptic number.
1100011111002 is an abundant number, since it is smaller than the sum of its proper divisors (1283346296208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100011111002 is a wasteful number, since it uses less digits than its factorization.
1100011111002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61111728397 (or 61111728394 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1100011111002 its reverse (2001111100011), we get a palindrome (3101122211013).
The spelling of 1100011111002 in words is "one trillion, one hundred billion, eleven million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •