Base | Representation |
---|---|
bin | 111101100001101… |
… | …0001000110110111 |
3 | 12022212122010120220 |
4 | 1323003101012313 |
5 | 13212000012241 |
6 | 540504225423 |
7 | 102105366351 |
oct | 17303210667 |
9 | 5285563526 |
10 | 2064454071 |
11 | 96a36a999 |
12 | 49746b273 |
13 | 26b923774 |
14 | 1582760d1 |
15 | c1395166 |
hex | 7b0d11b7 |
2064454071 has 4 divisors (see below), whose sum is σ = 2752605432. Its totient is φ = 1376302712.
The previous prime is 2064454069. The next prime is 2064454081. The reversal of 2064454071 is 1704544602.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2064454071 - 21 = 2064454069 is a prime.
It is a super-2 number, since 2×20644540712 = 8523941222536946082, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2064454081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 344075676 + ... + 344075681.
It is an arithmetic number, because the mean of its divisors is an integer number (688151358).
Almost surely, 22064454071 is an apocalyptic number.
2064454071 is a deficient number, since it is larger than the sum of its proper divisors (688151361).
2064454071 is an equidigital number, since it uses as much as digits as its factorization.
2064454071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688151360.
The product of its (nonzero) digits is 26880, while the sum is 33.
The square root of 2064454071 is about 45436.2638318777. The cubic root of 2064454071 is about 1273.3127128059.
Adding to 2064454071 its reverse (1704544602), we get a palindrome (3768998673).
The spelling of 2064454071 in words is "two billion, sixty-four million, four hundred fifty-four thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •