Base | Representation |
---|---|
bin | 11001001100000011011… |
… | …11011111010100010001 |
3 | 10001201220202100020111011 |
4 | 30212001233133110101 |
5 | 103134433033331101 |
6 | 1501331133250521 |
7 | 116346014165005 |
oct | 14460157372421 |
9 | 3051822306434 |
10 | 865465136401 |
11 | 304050563708 |
12 | 11b896633a41 |
13 | 637c7a31888 |
14 | 2dc62998705 |
15 | 177a5729751 |
hex | c981bdf511 |
865465136401 has 4 divisors (see below), whose sum is σ = 867689982900. Its totient is φ = 863240289904.
The previous prime is 865465136329. The next prime is 865465136413. The reversal of 865465136401 is 104631564568.
865465136401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 535529776401 + 329935360000 = 731799^2 + 574400^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-865465136401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (865465136461) 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, 1112422666 + ... + 1112423443.
It is an arithmetic number, because the mean of its divisors is an integer number (216922495725).
Almost surely, 2865465136401 is an apocalyptic number.
It is an amenable number.
865465136401 is a deficient number, since it is larger than the sum of its proper divisors (2224846499).
865465136401 is a wasteful number, since it uses less digits than its factorization.
865465136401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2224846498.
The product of its (nonzero) digits is 2073600, while the sum is 49.
The spelling of 865465136401 in words is "eight hundred sixty-five billion, four hundred sixty-five million, one hundred thirty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •