Base | Representation |
---|---|
bin | 10000001111010111000… |
… | …111101110011000000001 |
3 | 10221200121100112100012020 |
4 | 100033113013232120001 |
5 | 121241034421443230 |
6 | 2212404054152053 |
7 | 143425442362566 |
oct | 20172707563001 |
9 | 3850540470166 |
10 | 1116005656065 |
11 | 3a032810a323 |
12 | 160358052629 |
13 | 81314a91a91 |
14 | 3c02d0ac86d |
15 | 1e06ac12810 |
hex | 103d71ee601 |
1116005656065 has 32 divisors (see below), whose sum is σ = 1790813166336. Its totient is φ = 593470832640.
The previous prime is 1116005656063. The next prime is 1116005656069. The reversal of 1116005656065 is 5606565006111.
It is not a de Polignac number, because 1116005656065 - 21 = 1116005656063 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1116005656063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7065837 + ... + 7222053.
It is an arithmetic number, because the mean of its divisors is an integer number (55962911448).
Almost surely, 21116005656065 is an apocalyptic number.
1116005656065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1116005656065 is a deficient number, since it is larger than the sum of its proper divisors (674807510271).
1116005656065 is a wasteful number, since it uses less digits than its factorization.
1116005656065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157609.
The product of its (nonzero) digits is 162000, while the sum is 42.
The spelling of 1116005656065 in words is "one trillion, one hundred sixteen billion, five million, six hundred fifty-six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •