Base | Representation |
---|---|
bin | 1111010010010… |
… | …0011011100101 |
3 | 11110122020121202 |
4 | 3310210123211 |
5 | 112403043412 |
6 | 10210052245 |
7 | 1405642331 |
oct | 364443345 |
9 | 143566552 |
10 | 64112357 |
11 | 3320a621 |
12 | 1957a085 |
13 | 10389a0a |
14 | 872c7c1 |
15 | 59663c2 |
hex | 3d246e5 |
64112357 has 4 divisors (see below), whose sum is σ = 64128576. Its totient is φ = 64096140.
The previous prime is 64112353. The next prime is 64112369. The reversal of 64112357 is 75321146.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 75321146 = 2 ⋅37660573.
It is a cyclic number.
It is not a de Polignac number, because 64112357 - 22 = 64112353 is a prime.
It is a super-2 number, since 2×641123572 = 8220788640190898, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64112353) 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, 2132 + ... + 11522.
It is an arithmetic number, because the mean of its divisors is an integer number (16032144).
Almost surely, 264112357 is an apocalyptic number.
It is an amenable number.
64112357 is a deficient number, since it is larger than the sum of its proper divisors (16219).
64112357 is an equidigital number, since it uses as much as digits as its factorization.
64112357 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16218.
The product of its digits is 5040, while the sum is 29.
The square root of 64112357 is about 8007.0192331479. The cubic root of 64112357 is about 400.2339402366.
The spelling of 64112357 in words is "sixty-four million, one hundred twelve thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •