Base | Representation |
---|---|
bin | 10000001010101100110… |
… | …100100001001100111010 |
3 | 10221012200120102000210200 |
4 | 100022230310201030322 |
5 | 121200312224323002 |
6 | 2210215315223030 |
7 | 143160432530631 |
oct | 20125464411472 |
9 | 3835616360720 |
10 | 1111001011002 |
11 | 39919a11a423 |
12 | 15b39bba7a76 |
13 | 809c7c97b3c |
14 | 3bab655c518 |
15 | 1dd7668eb1c |
hex | 102acd2133a |
1111001011002 has 96 divisors (see below), whose sum is σ = 2488454654400. Its totient is φ = 358014214656.
The previous prime is 1111001010989. The next prime is 1111001011007. The reversal of 1111001011002 is 2001101001111.
It is a super-2 number, since 2×11110010110022 (a number of 25 digits) contains 22 as substring.
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 (1111001011007) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 64625824 + ... + 64643012.
It is an arithmetic number, because the mean of its divisors is an integer number (25921402650).
Almost surely, 21111001011002 is an apocalyptic number.
1111001011002 is an abundant number, since it is smaller than the sum of its proper divisors (1377453643398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111001011002 is a wasteful number, since it uses less digits than its factorization.
1111001011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18092 (or 18089 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1111001011002 its reverse (2001101001111), we get a palindrome (3112102012113).
The spelling of 1111001011002 in words is "one trillion, one hundred eleven billion, one million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •