Base | Representation |
---|---|
bin | 11101010100001100000001… |
… | …00100100010001011101011 |
3 | 22110020211021002000200200220 |
4 | 32222012000210202023223 |
5 | 31422144434212102012 |
6 | 345034543144501123 |
7 | 16402315520100054 |
oct | 1652060044421353 |
9 | 273224232020626 |
10 | 64465321206507 |
11 | 195a4653239361 |
12 | 729198977a7a3 |
13 | 29c8090cb5430 |
14 | 11cc1d12c372b |
15 | 76bd56e0d08c |
hex | 3aa1809222eb |
64465321206507 has 16 divisors (see below), whose sum is σ = 93737305751040. Its totient is φ = 39168802756512.
The previous prime is 64465321206499. The next prime is 64465321206529. The reversal of 64465321206507 is 70560212356446.
It is not a de Polignac number, because 64465321206507 - 23 = 64465321206499 is a prime.
It is a super-2 number, since 2×644653212065072 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 64465321206507.
It is not an unprimeable number, because it can be changed into a prime (64465321206107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10461749793 + ... + 10461755954.
It is an arithmetic number, because the mean of its divisors is an integer number (5858581609440).
Almost surely, 264465321206507 is an apocalyptic number.
64465321206507 is a deficient number, since it is larger than the sum of its proper divisors (29271984544533).
64465321206507 is a wasteful number, since it uses less digits than its factorization.
64465321206507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20923505842.
The product of its (nonzero) digits is 7257600, while the sum is 51.
The spelling of 64465321206507 in words is "sixty-four trillion, four hundred sixty-five billion, three hundred twenty-one million, two hundred six thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •