Base | Representation |
---|---|
bin | 11110111110100100010… |
… | …11111001100110101001 |
3 | 10202202100200212202110011 |
4 | 33133102023321212221 |
5 | 114414324103211001 |
6 | 2132545415051521 |
7 | 136620260256451 |
oct | 17372213714651 |
9 | 3682320782404 |
10 | 1064383257001 |
11 | 3804476668a9 |
12 | 15234b970ba1 |
13 | 794a8b75c0c |
14 | 397330d6d61 |
15 | 1ca48be6d51 |
hex | f7d22f99a9 |
1064383257001 has 4 divisors (see below), whose sum is σ = 1064434744404. Its totient is φ = 1064331769600.
The previous prime is 1064383256977. The next prime is 1064383257079. The reversal of 1064383257001 is 1007523834601.
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 450509440000 + 613873817001 = 671200^2 + 783501^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1064383257001 is a prime.
It is a super-2 number, since 2×10643832570012 (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 (1064383257101) 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, 25712680 + ... + 25754041.
It is an arithmetic number, because the mean of its divisors is an integer number (266108686101).
Almost surely, 21064383257001 is an apocalyptic number.
It is an amenable number.
1064383257001 is a deficient number, since it is larger than the sum of its proper divisors (51487403).
1064383257001 is an equidigital number, since it uses as much as digits as its factorization.
1064383257001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51487402.
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 1064383257001 in words is "one trillion, sixty-four billion, three hundred eighty-three million, two hundred fifty-seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •