Base | Representation |
---|---|
bin | 111101100001001… |
… | …1100110111000111 |
3 | 12022212020021000222 |
4 | 1323002130313013 |
5 | 13211421140241 |
6 | 540455454555 |
7 | 102103515425 |
oct | 17302346707 |
9 | 5285207028 |
10 | 2064240071 |
11 | 96a234133 |
12 | 49738745b |
13 | 26b87a23a |
14 | 15821c115 |
15 | c1351a4b |
hex | 7b09cdc7 |
2064240071 has 8 divisors (see below), whose sum is σ = 2071409760. Its totient is φ = 2057083552.
The previous prime is 2064240049. The next prime is 2064240089. The reversal of 2064240071 is 1700424602.
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 2064240071 - 230 = 990498247 is a prime.
It is a super-2 number, since 2×20642400712 = 8522174141444170082, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2064240071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2064240001) 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, 386165 + ... + 391473.
It is an arithmetic number, because the mean of its divisors is an integer number (258926220).
Almost surely, 22064240071 is an apocalyptic number.
2064240071 is a deficient number, since it is larger than the sum of its proper divisors (7169689).
2064240071 is an equidigital number, since it uses as much as digits as its factorization.
2064240071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6585.
The product of its (nonzero) digits is 2688, while the sum is 26.
The square root of 2064240071 is about 45433.9088236969. The cubic root of 2064240071 is about 1273.2687143561.
Adding to 2064240071 its reverse (1700424602), we get a palindrome (3764664673).
The spelling of 2064240071 in words is "two billion, sixty-four million, two hundred forty thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •