Base | Representation |
---|---|
bin | 1111011111001… |
… | …1101001100011 |
3 | 11112020100220112 |
4 | 3313303221203 |
5 | 113112223443 |
6 | 10240201535 |
7 | 1416106013 |
oct | 367635143 |
9 | 145210815 |
10 | 64961123 |
11 | 3373a287 |
12 | 199092ab |
13 | 105c6146 |
14 | 88adc43 |
15 | 5a82b18 |
hex | 3df3a63 |
64961123 has 4 divisors (see below), whose sum is σ = 65930760. Its totient is φ = 63991488.
The previous prime is 64961111. The next prime is 64961129. The reversal of 64961123 is 32116946.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32116946 = 2 ⋅16058473.
It is a cyclic number.
It is not a de Polignac number, because 64961123 - 24 = 64961107 is a prime.
It is a super-2 number, since 2×649611232 = 8439895002842258, 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 64961123.
It is not an unprimeable number, because it can be changed into a prime (64961129) 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, 484718 + ... + 484851.
It is an arithmetic number, because the mean of its divisors is an integer number (16482690).
Almost surely, 264961123 is an apocalyptic number.
64961123 is a deficient number, since it is larger than the sum of its proper divisors (969637).
64961123 is an equidigital number, since it uses as much as digits as its factorization.
64961123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 969636.
The product of its digits is 7776, while the sum is 32.
The square root of 64961123 is about 8059.8463384856. The cubic root of 64961123 is about 401.9923989718.
The spelling of 64961123 in words is "sixty-four million, nine hundred sixty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •