Base | Representation |
---|---|
bin | 111100000101010101… |
… | …111101011011000101 |
3 | 20011112002202111022222 |
4 | 330011111331123011 |
5 | 2024111110332013 |
6 | 45345402102125 |
7 | 4442502150044 |
oct | 740525753305 |
9 | 204462674288 |
10 | 64514152133 |
11 | 253a6614402 |
12 | 106057aa945 |
13 | 6111a4a422 |
14 | 31a020455b |
15 | 1a28bd9508 |
hex | f0557d6c5 |
64514152133 has 4 divisors (see below), whose sum is σ = 64542537228. Its totient is φ = 64485767040.
The previous prime is 64514152099. The next prime is 64514152139. The reversal of 64514152133 is 33125141546.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 58053529249 + 6460622884 = 240943^2 + 80378^2 .
It is a cyclic number.
It is not a de Polignac number, because 64514152133 - 26 = 64514152069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 64514152093 and 64514152102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64514152139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14189138 + ... + 14193683.
It is an arithmetic number, because the mean of its divisors is an integer number (16135634307).
Almost surely, 264514152133 is an apocalyptic number.
It is an amenable number.
64514152133 is a deficient number, since it is larger than the sum of its proper divisors (28385095).
64514152133 is a wasteful number, since it uses less digits than its factorization.
64514152133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28385094.
The product of its digits is 43200, while the sum is 35.
Adding to 64514152133 its reverse (33125141546), we get a palindrome (97639293679).
The spelling of 64514152133 in words is "sixty-four billion, five hundred fourteen million, one hundred fifty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •