Base | Representation |
---|---|
bin | 10000000010101000110… |
… | …110100100100001010000 |
3 | 10220101100021122222112222 |
4 | 100002220312210201100 |
5 | 121030100143133144 |
6 | 2202224324240212 |
7 | 142433060460221 |
oct | 20025066444120 |
9 | 3811307588488 |
10 | 1102344505424 |
11 | 39555780a688 |
12 | 159784b40068 |
13 | 7cc487338a6 |
14 | 3b4d49dd248 |
15 | 1da1b7142ee |
hex | 100a8da4850 |
1102344505424 has 10 divisors (see below), whose sum is σ = 2135792479290. Its totient is φ = 551172252704.
The previous prime is 1102344505421. The next prime is 1102344505441. The reversal of 1102344505424 is 4245054432011.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1102206019600 + 138485824 = 1049860^2 + 11768^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102344505421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34448265779 + ... + 34448265810.
It is an arithmetic number, because the mean of its divisors is an integer number (213579247929).
Almost surely, 21102344505424 is an apocalyptic number.
It is an amenable number.
1102344505424 is a deficient number, since it is larger than the sum of its proper divisors (1033447973866).
1102344505424 is an equidigital number, since it uses as much as digits as its factorization.
1102344505424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68896531597 (or 68896531591 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 35.
Adding to 1102344505424 its reverse (4245054432011), we get a palindrome (5347398937435).
The spelling of 1102344505424 in words is "one trillion, one hundred two billion, three hundred forty-four million, five hundred five thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •