Base | Representation |
---|---|
bin | 111011001001000011000… |
… | …011111010100001110101 |
3 | 112101112022120212211120202 |
4 | 323021003003322201311 |
5 | 1013041402011133103 |
6 | 12351015022410245 |
7 | 566424530245601 |
oct | 73110303724165 |
9 | 15345276784522 |
10 | 4064164161653 |
11 | 1327669797a42 |
12 | 5577b4430985 |
13 | 2363311940ab |
14 | 1009c6c7a501 |
15 | 70ab90ad988 |
hex | 3b2430fa875 |
4064164161653 has 2 divisors, whose sum is σ = 4064164161654. Its totient is φ = 4064164161652.
The previous prime is 4064164161583. The next prime is 4064164161667. The reversal of 4064164161653 is 3561614614604.
4064164161653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3033090446929 + 1031073714724 = 1741577^2 + 1015418^2 .
It is a cyclic number.
It is not a de Polignac number, because 4064164161653 - 228 = 4063895726197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4064164161598 and 4064164161607.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4064164161553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2032082080826 + 2032082080827.
It is an arithmetic number, because the mean of its divisors is an integer number (2032082080827).
Almost surely, 24064164161653 is an apocalyptic number.
It is an amenable number.
4064164161653 is a deficient number, since it is larger than the sum of its proper divisors (1).
4064164161653 is an equidigital number, since it uses as much as digits as its factorization.
4064164161653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1244160, while the sum is 47.
The spelling of 4064164161653 in words is "four trillion, sixty-four billion, one hundred sixty-four million, one hundred sixty-one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •