Base | Representation |
---|---|
bin | 10000001111010111101… |
… | …011100110011010110101 |
3 | 10221200122000020010212121 |
4 | 100033113223212122311 |
5 | 121241044323420121 |
6 | 2212405031515541 |
7 | 143425615332334 |
oct | 20172753463265 |
9 | 3850560203777 |
10 | 1116015060661 |
11 | 3a0332453116 |
12 | 16035b228bb1 |
13 | 81316a05627 |
14 | 3c030439d1b |
15 | 1e06b96e141 |
hex | 103d7ae66b5 |
1116015060661 has 4 divisors (see below), whose sum is σ = 1137071948652. Its totient is φ = 1094958172672.
The previous prime is 1116015060647. The next prime is 1116015060683. The reversal of 1116015060661 is 1660605106111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 587973038436 + 528042022225 = 766794^2 + 726665^2 .
It is a cyclic number.
It is not a de Polignac number, because 1116015060661 - 221 = 1116012963509 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 (1116015010661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10528443916 + ... + 10528444021.
It is an arithmetic number, because the mean of its divisors is an integer number (284267987163).
Almost surely, 21116015060661 is an apocalyptic number.
It is an amenable number.
1116015060661 is a deficient number, since it is larger than the sum of its proper divisors (21056887991).
1116015060661 is an equidigital number, since it uses as much as digits as its factorization.
1116015060661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21056887990.
The product of its (nonzero) digits is 6480, while the sum is 34.
The spelling of 1116015060661 in words is "one trillion, one hundred sixteen billion, fifteen million, sixty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •