Base | Representation |
---|---|
bin | 11101001100001101111101… |
… | …11001100110101011000001 |
3 | 22102021122110020102211111121 |
4 | 32212012332321212223001 |
5 | 31403203132141312434 |
6 | 344305055110312241 |
7 | 16343452636610650 |
oct | 1646067671465301 |
9 | 272248406384447 |
10 | 64191489010369 |
11 | 194a9504094446 |
12 | 72488a7958681 |
13 | 29a8301620a46 |
14 | 11bcc55677197 |
15 | 764b7bbec7b4 |
hex | 3a61bee66ac1 |
64191489010369 has 4 divisors (see below), whose sum is σ = 73361701726144. Its totient is φ = 55021276294596.
The previous prime is 64191489010289. The next prime is 64191489010391. The reversal of 64191489010369 is 96301098419146.
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.
It is a cyclic number.
It is not a de Polignac number, because 64191489010369 - 221 = 64191486913217 is a prime.
It is a super-2 number, since 2×641914890103692 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (64191489010069) 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, 4585106357877 + ... + 4585106357890.
It is an arithmetic number, because the mean of its divisors is an integer number (18340425431536).
Almost surely, 264191489010369 is an apocalyptic number.
It is an amenable number.
64191489010369 is a deficient number, since it is larger than the sum of its proper divisors (9170212715775).
64191489010369 is an equidigital number, since it uses as much as digits as its factorization.
64191489010369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9170212715774.
The product of its (nonzero) digits is 10077696, while the sum is 61.
The spelling of 64191489010369 in words is "sixty-four trillion, one hundred ninety-one billion, four hundred eighty-nine million, ten thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •