Base | Representation |
---|---|
bin | 111111011011011… |
… | …001011001100110 |
3 | 2202011101020121121 |
4 | 333123121121212 |
5 | 4134410142114 |
6 | 253332204154 |
7 | 35241045013 |
oct | 7733313146 |
9 | 2664336547 |
10 | 1064146534 |
11 | 4a6757050 |
12 | 25846965a |
13 | 13c609609 |
14 | a148870a |
15 | 63652a24 |
hex | 3f6d9666 |
1064146534 has 8 divisors (see below), whose sum is σ = 1741330728. Its totient is φ = 483702960.
The previous prime is 1064146507. The next prime is 1064146537. The reversal of 1064146534 is 4356414601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10641465342 = 2264815691648426312, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1064146534.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1064146537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24185127 + ... + 24185170.
It is an arithmetic number, because the mean of its divisors is an integer number (217666341).
Almost surely, 21064146534 is an apocalyptic number.
1064146534 is a deficient number, since it is larger than the sum of its proper divisors (677184194).
1064146534 is a wasteful number, since it uses less digits than its factorization.
1064146534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48370310.
The product of its (nonzero) digits is 34560, while the sum is 34.
The square root of 1064146534 is about 32621.2589272701. The cubic root of 1064146534 is about 1020.9406080522.
It can be divided in two parts, 10641 and 46534, that added together give a palindrome (57175).
The spelling of 1064146534 in words is "one billion, sixty-four million, one hundred forty-six thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •