Base | Representation |
---|---|
bin | 11110101111010101010… |
… | …10100111001010000101 |
3 | 10201222020200012210112012 |
4 | 33113222222213022011 |
5 | 114301101212322001 |
6 | 2125114033504005 |
7 | 136210502044421 |
oct | 17275252471205 |
9 | 3658220183465 |
10 | 1056204026501 |
11 | 377a2a701978 |
12 | 150848712005 |
13 | 787a446b260 |
14 | 39198ad5b81 |
15 | 1c71aae62bb |
hex | f5eaaa7285 |
1056204026501 has 4 divisors (see below), whose sum is σ = 1137450490092. Its totient is φ = 974957562912.
The previous prime is 1056204026447. The next prime is 1056204026569.
1056204026501 is nontrivially palindromic in base 10.
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 367146317476 + 689057709025 = 605926^2 + 830095^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1056204026501 is a prime.
It is a super-2 number, since 2×10562040265012 (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 (1056204226501) 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, 40623231776 + ... + 40623231801.
It is an arithmetic number, because the mean of its divisors is an integer number (284362622523).
Almost surely, 21056204026501 is an apocalyptic number.
It is an amenable number.
1056204026501 is a deficient number, since it is larger than the sum of its proper divisors (81246463591).
1056204026501 is an equidigital number, since it uses as much as digits as its factorization.
1056204026501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81246463590.
The product of its (nonzero) digits is 14400, while the sum is 32.
The spelling of 1056204026501 in words is "one trillion, fifty-six billion, two hundred four million, twenty-six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •