Base | Representation |
---|---|
bin | 10111110001110100… |
… | …00110100000000101 |
3 | 1012221200022200101220 |
4 | 23320322012200011 |
5 | 202121033241031 |
6 | 5510425510553 |
7 | 631231326330 |
oct | 137072064005 |
9 | 35850280356 |
10 | 12765915141 |
11 | 5461031aa1 |
12 | 2583342459 |
13 | 1285a42355 |
14 | 891633617 |
15 | 4eab13596 |
hex | 2f8e86805 |
12765915141 has 16 divisors (see below), whose sum is σ = 19565272704. Its totient is φ = 7252640064.
The previous prime is 12765915133. The next prime is 12765915157. The reversal of 12765915141 is 14151956721.
It is not a de Polignac number, because 12765915141 - 23 = 12765915133 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12765915093 and 12765915102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12765915191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1753306 + ... + 1760571.
It is an arithmetic number, because the mean of its divisors is an integer number (1222829544).
Almost surely, 212765915141 is an apocalyptic number.
It is an amenable number.
12765915141 is a deficient number, since it is larger than the sum of its proper divisors (6799357563).
12765915141 is a wasteful number, since it uses less digits than its factorization.
12765915141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3514060.
The product of its digits is 75600, while the sum is 42.
The spelling of 12765915141 in words is "twelve billion, seven hundred sixty-five million, nine hundred fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •