Base | Representation |
---|---|
bin | 11111101101000110001… |
… | …11001110010000100001 |
3 | 10212010211121020200221210 |
4 | 33312203013032100201 |
5 | 120322004001234010 |
6 | 2152240244140333 |
7 | 141463303213266 |
oct | 17664307162041 |
9 | 3763747220853 |
10 | 1089363305505 |
11 | 38aaa6205a92 |
12 | 1571616976a9 |
13 | 7b95a2150c7 |
14 | 3aa2296926d |
15 | 1d50bc77b20 |
hex | fda31ce421 |
1089363305505 has 8 divisors (see below), whose sum is σ = 1742981288832. Its totient is φ = 580993762928.
The previous prime is 1089363305491. The next prime is 1089363305551. The reversal of 1089363305505 is 5055033639801.
1089363305505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1089363305505 - 24 = 1089363305489 is a prime.
It is a super-2 number, since 2×10893633055052 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36312110169 + ... + 36312110198.
It is an arithmetic number, because the mean of its divisors is an integer number (217872661104).
Almost surely, 21089363305505 is an apocalyptic number.
1089363305505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1089363305505 is a deficient number, since it is larger than the sum of its proper divisors (653617983327).
1089363305505 is an equidigital number, since it uses as much as digits as its factorization.
1089363305505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72624220375.
The product of its (nonzero) digits is 1458000, while the sum is 48.
The spelling of 1089363305505 in words is "one trillion, eighty-nine billion, three hundred sixty-three million, three hundred five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •