Base | Representation |
---|---|
bin | 10111100100001011… |
… | …11111010110001101 |
3 | 1012122201012102020102 |
4 | 23302011333112031 |
5 | 201402301403203 |
6 | 5451223300445 |
7 | 625342515053 |
oct | 136205772615 |
9 | 35581172212 |
10 | 12651591053 |
11 | 5402547682 |
12 | 2550baa725 |
13 | 1268154a6a |
14 | 8803941d3 |
15 | 4e0a7e888 |
hex | 2f217f58d |
12651591053 has 4 divisors (see below), whose sum is σ = 12698623260. Its totient is φ = 12604558848.
The previous prime is 12651590999. The next prime is 12651591089. The reversal of 12651591053 is 35019515621.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35019515621 = 229 ⋅152923649.
It can be written as a sum of positive squares in 2 ways, for example, as 792816649 + 11858774404 = 28157^2 + 108898^2 .
It is a cyclic number.
It is not a de Polignac number, because 12651591053 - 216 = 12651525517 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12651590998 and 12651591016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12651596053) 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, 23515700 + ... + 23516237.
It is an arithmetic number, because the mean of its divisors is an integer number (3174655815).
Almost surely, 212651591053 is an apocalyptic number.
It is an amenable number.
12651591053 is a deficient number, since it is larger than the sum of its proper divisors (47032207).
12651591053 is an equidigital number, since it uses as much as digits as its factorization.
12651591053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47032206.
The product of its (nonzero) digits is 40500, while the sum is 38.
The spelling of 12651591053 in words is "twelve billion, six hundred fifty-one million, five hundred ninety-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •