Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …111111101010010110000 |
3 | 10220011120001220101202111 |
4 | 100000203033331102300 |
5 | 121011002332413202 |
6 | 2201214053255104 |
7 | 142323402220414 |
oct | 20004317752260 |
9 | 3804501811674 |
10 | 1100103013552 |
11 | 394607520664 |
12 | 15925a334494 |
13 | 7c97c23563a |
14 | 3b361040d44 |
15 | 1d939a4d6d7 |
hex | 100233fd4b0 |
1100103013552 has 80 divisors (see below), whose sum is σ = 2284131708000. Its totient is φ = 511722731520.
The previous prime is 1100103013501. The next prime is 1100103013567. The reversal of 1100103013552 is 2553103010011.
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 15 ways as a sum of consecutive naturals, for example, 11393574 + ... + 11489722.
It is an arithmetic number, because the mean of its divisors is an integer number (28551646350).
Almost surely, 21100103013552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1100103013552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1142065854000).
1100103013552 is an abundant number, since it is smaller than the sum of its proper divisors (1184028694448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100103013552 is a wasteful number, since it uses less digits than its factorization.
1100103013552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96854 (or 96848 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 22.
Adding to 1100103013552 its reverse (2553103010011), we get a palindrome (3653206023563).
The spelling of 1100103013552 in words is "one trillion, one hundred billion, one hundred three million, thirteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •