Base | Representation |
---|---|
bin | 10000000000110110011… |
… | …010001001010101001101 |
3 | 10220012101110202010121011 |
4 | 100000312122021111031 |
5 | 121012132124421110 |
6 | 2201310015005221 |
7 | 142334354335126 |
oct | 20006632112515 |
9 | 3805343663534 |
10 | 1100424451405 |
11 | 394761a07684 |
12 | 159329b09811 |
13 | 7ca009cb156 |
14 | 3b3919d504d |
15 | 1d957d9448a |
hex | 1003668954d |
1100424451405 has 8 divisors (see below), whose sum is σ = 1342157036184. Its totient is φ = 865907764800.
The previous prime is 1100424451403. The next prime is 1100424451417. The reversal of 1100424451405 is 5041544240011.
It can be written as a sum of positive squares in 4 ways, for example, as 94026249769 + 1006398201636 = 306637^2 + 1003194^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100424451405 - 21 = 1100424451403 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100424451403) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1803974206 + ... + 1803974815.
It is an arithmetic number, because the mean of its divisors is an integer number (167769629523).
Almost surely, 21100424451405 is an apocalyptic number.
It is an amenable number.
1100424451405 is a deficient number, since it is larger than the sum of its proper divisors (241732584779).
1100424451405 is an equidigital number, since it uses as much as digits as its factorization.
1100424451405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3607949087.
The product of its (nonzero) digits is 12800, while the sum is 31.
Adding to 1100424451405 its reverse (5041544240011), we get a palindrome (6141968691416).
The spelling of 1100424451405 in words is "one trillion, one hundred billion, four hundred twenty-four million, four hundred fifty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •