Base | Representation |
---|---|
bin | 11110110000010000100… |
… | …01001001001010000101 |
3 | 10202000112021201201112021 |
4 | 33120020101021022011 |
5 | 114303110332312001 |
6 | 2125235214323141 |
7 | 136226012315434 |
oct | 17301021111205 |
9 | 3660467651467 |
10 | 1056700666501 |
11 | 378164a83957 |
12 | 150966ab94b1 |
13 | 78853317b8c |
14 | 39204a5511b |
15 | 1c7494e8ba1 |
hex | f608449285 |
1056700666501 has 4 divisors (see below), whose sum is σ = 1085260144012. Its totient is φ = 1028141188992.
The previous prime is 1056700666499. The next prime is 1056700666531. The reversal of 1056700666501 is 1056660076501.
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 958296113476 + 98404553025 = 978926^2 + 313695^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056700666501 - 21 = 1056700666499 is a prime.
It is a super-2 number, since 2×10567006665012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056700666531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14279738700 + ... + 14279738773.
It is an arithmetic number, because the mean of its divisors is an integer number (271315036003).
Almost surely, 21056700666501 is an apocalyptic number.
It is an amenable number.
1056700666501 is a deficient number, since it is larger than the sum of its proper divisors (28559477511).
1056700666501 is an equidigital number, since it uses as much as digits as its factorization.
1056700666501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28559477510.
The product of its (nonzero) digits is 226800, while the sum is 43.
The spelling of 1056700666501 in words is "one trillion, fifty-six billion, seven hundred million, six hundred sixty-six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •