Base | Representation |
---|---|
bin | 11110110000001101010… |
… | …10111110111110100001 |
3 | 10202000110102100010202001 |
4 | 33120012222332332201 |
5 | 114303032003323423 |
6 | 2125232420324001 |
7 | 136225235556466 |
oct | 17300652767641 |
9 | 3660412303661 |
10 | 1056673886113 |
11 | 3781509523aa |
12 | 150959b43601 |
13 | 7884a8cc4b1 |
14 | 3920128366d |
15 | 1c746ea8cad |
hex | f606abefa1 |
1056673886113 has 8 divisors (see below), whose sum is σ = 1059676876800. Its totient is φ = 1053672027408.
The previous prime is 1056673886071. The next prime is 1056673886117. The reversal of 1056673886113 is 3116883766501.
It is a happy number.
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 1056673886113 - 221 = 1056671788961 is a prime.
It is a super-2 number, since 2×10566738861132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1056673886117) 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 7 ways as a sum of consecutive naturals, for example, 1604448 + ... + 2165086.
It is an arithmetic number, because the mean of its divisors is an integer number (132459609600).
Almost surely, 21056673886113 is an apocalyptic number.
It is an amenable number.
1056673886113 is a deficient number, since it is larger than the sum of its proper divisors (3002990687).
1056673886113 is an equidigital number, since it uses as much as digits as its factorization.
1056673886113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565991.
The product of its (nonzero) digits is 4354560, while the sum is 55.
The spelling of 1056673886113 in words is "one trillion, fifty-six billion, six hundred seventy-three million, eight hundred eighty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •