Base | Representation |
---|---|
bin | 11110111110100111110… |
… | …10000110001111011001 |
3 | 10202202102201020101210021 |
4 | 33133103322012033121 |
5 | 114414404002111401 |
6 | 2132552330150441 |
7 | 136621060643041 |
oct | 17372372061731 |
9 | 3682381211707 |
10 | 1064412144601 |
11 | 3804619a7553 |
12 | 152359582421 |
13 | 794b1b4b780 |
14 | 39736c96721 |
15 | 1ca4b5012a1 |
hex | f7d3e863d9 |
1064412144601 has 8 divisors (see below), whose sum is σ = 1152108735624. Its totient is φ = 977546801280.
The previous prime is 1064412144533. The next prime is 1064412144643.
1064412144601 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 98366913225 + 966045231376 = 313635^2 + 982876^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 1064412144601 - 27 = 1064412144473 is a prime.
It is a super-2 number, since 2×10644121446012 (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 (1064412744601) 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, 207809260 + ... + 207814381.
It is an arithmetic number, because the mean of its divisors is an integer number (144013591953).
Almost surely, 21064412144601 is an apocalyptic number.
It is an amenable number.
1064412144601 is a deficient number, since it is larger than the sum of its proper divisors (87696591023).
1064412144601 is a wasteful number, since it uses less digits than its factorization.
1064412144601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415623851.
The product of its (nonzero) digits is 18432, while the sum is 34.
The spelling of 1064412144601 in words is "one trillion, sixty-four billion, four hundred twelve million, one hundred forty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •