Base | Representation |
---|---|
bin | 111100001011010110… |
… | …010111001110001111 |
3 | 20011210010101002101001 |
4 | 330023112113032033 |
5 | 2024312404433403 |
6 | 45403402001131 |
7 | 4445134524115 |
oct | 741326271617 |
9 | 204703332331 |
10 | 64614921103 |
11 | 25448490647 |
12 | 106334a61a7 |
13 | 612989cc35 |
14 | 31ad755ab5 |
15 | 1a32991c1d |
hex | f0b59738f |
64614921103 has 4 divisors (see below), whose sum is σ = 66361270360. Its totient is φ = 62868571848.
The previous prime is 64614921101. The next prime is 64614921109. The reversal of 64614921103 is 30112941646.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30112941646 = 2 ⋅15056470823.
It is a cyclic number.
It is not a de Polignac number, because 64614921103 - 21 = 64614921101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37), and also a Moran number because the ratio is a prime number: 1746349219 = 64614921103 / (6 + 4 + 6 + 1 + 4 + 9 + 2 + 1 + 1 + 0 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64614921101) 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, 873174573 + ... + 873174646.
It is an arithmetic number, because the mean of its divisors is an integer number (16590317590).
Almost surely, 264614921103 is an apocalyptic number.
64614921103 is a deficient number, since it is larger than the sum of its proper divisors (1746349257).
64614921103 is a wasteful number, since it uses less digits than its factorization.
64614921103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1746349256.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 64614921103 in words is "sixty-four billion, six hundred fourteen million, nine hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •