Base | Representation |
---|---|
bin | 11110111110011010111… |
… | …11101000100101000101 |
3 | 10202202011012202201121101 |
4 | 33133031133220211011 |
5 | 114414143430402234 |
6 | 2132533524020101 |
7 | 136615313233624 |
oct | 17371537504505 |
9 | 3682135681541 |
10 | 1064304544069 |
11 | 380407194698 |
12 | 152329531631 |
13 | 79495776610 |
14 | 397268876bb |
15 | 1ca41d49814 |
hex | f7cd7e8945 |
1064304544069 has 8 divisors (see below), whose sum is σ = 1148292753272. Its totient is φ = 980618996160.
The previous prime is 1064304544031. The next prime is 1064304544117. The reversal of 1064304544069 is 9604454034601.
It can be written as a sum of positive squares in 4 ways, for example, as 27852272100 + 1036452271969 = 166890^2 + 1018063^2 .
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 1064304544069 - 27 = 1064304543941 is a prime.
It is a super-2 number, since 2×10643045440692 (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 (1064304544019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75658014 + ... + 75672079.
It is an arithmetic number, because the mean of its divisors is an integer number (143536594159).
Almost surely, 21064304544069 is an apocalyptic number.
It is an amenable number.
1064304544069 is a deficient number, since it is larger than the sum of its proper divisors (83988209203).
1064304544069 is a wasteful number, since it uses less digits than its factorization.
1064304544069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151330647.
The product of its (nonzero) digits is 1244160, while the sum is 46.
The spelling of 1064304544069 in words is "one trillion, sixty-four billion, three hundred four million, five hundred forty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •