Base | Representation |
---|---|
bin | 10000000010101001011… |
… | …111001010001101001001 |
3 | 10220101101000200120001112 |
4 | 100002221133022031021 |
5 | 121030110404124140 |
6 | 2202225344300105 |
7 | 142433250064043 |
oct | 20025137121511 |
9 | 3811330616045 |
10 | 1102355145545 |
11 | 395562817775 |
12 | 159788611635 |
13 | 7cc4a9ba914 |
14 | 3b4d61aca93 |
15 | 1da1c616c65 |
hex | 100a97ca349 |
1102355145545 has 8 divisors (see below), whose sum is σ = 1323167044680. Its totient is φ = 881656869760.
The previous prime is 1102355145533. The next prime is 1102355145557. The reversal of 1102355145545 is 5455415532011.
It is an interprime number because it is at equal distance from previous prime (1102355145533) and next prime (1102355145557).
It can be written as a sum of positive squares in 4 ways, for example, as 465418670656 + 636936474889 = 682216^2 + 798083^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1102355145545 - 28 = 1102355145289 is a prime.
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 7 ways as a sum of consecutive naturals, for example, 28384490 + ... + 28423299.
It is an arithmetic number, because the mean of its divisors is an integer number (165395880585).
Almost surely, 21102355145545 is an apocalyptic number.
It is an amenable number.
1102355145545 is a deficient number, since it is larger than the sum of its proper divisors (220811899135).
1102355145545 is an equidigital number, since it uses as much as digits as its factorization.
1102355145545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56811675.
The product of its (nonzero) digits is 300000, while the sum is 41.
The spelling of 1102355145545 in words is "one trillion, one hundred two billion, three hundred fifty-five million, one hundred forty-five thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •