Base | Representation |
---|---|
bin | 111100101000101010… |
… | …000100110111010101 |
3 | 20020001101121101111120 |
4 | 330220222010313111 |
5 | 2031314244044203 |
6 | 45524244554153 |
7 | 4463255131065 |
oct | 745052046725 |
9 | 206041541446 |
10 | 65106628053 |
11 | 2567aaa3325 |
12 | 107500b2959 |
13 | 61a77103ac |
14 | 3218b8d3a5 |
15 | 1a60c1cb53 |
hex | f28a84dd5 |
65106628053 has 4 divisors (see below), whose sum is σ = 86808837408. Its totient is φ = 43404418700.
The previous prime is 65106628051. The next prime is 65106628061. The reversal of 65106628053 is 35082660156.
It is a happy number.
65106628053 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, 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 65106628053 - 21 = 65106628051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 65106627996 and 65106628014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65106628051) 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, 10851104673 + ... + 10851104678.
It is an arithmetic number, because the mean of its divisors is an integer number (21702209352).
Almost surely, 265106628053 is an apocalyptic number.
It is an amenable number.
65106628053 is a deficient number, since it is larger than the sum of its proper divisors (21702209355).
65106628053 is a wasteful number, since it uses less digits than its factorization.
65106628053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21702209354.
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 65106628053 in words is "sixty-five billion, one hundred six million, six hundred twenty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •