Base | Representation |
---|---|
bin | 10111101011001101… |
… | …00111100101101101 |
3 | 1012210211000002101121 |
4 | 23311212213211231 |
5 | 202012340214031 |
6 | 5501125340541 |
7 | 626656156516 |
oct | 136546474555 |
9 | 35724002347 |
10 | 12710476141 |
11 | 5432806940 |
12 | 2568867751 |
13 | 12774013cc |
14 | 888121a0d |
15 | 4e5d12011 |
hex | 2f59a796d |
12710476141 has 16 divisors (see below), whose sum is σ = 14195736000. Its totient is φ = 11282809600.
The previous prime is 12710476127. The next prime is 12710476153. The reversal of 12710476141 is 14167401721.
It is a cyclic number.
It is not a de Polignac number, because 12710476141 - 219 = 12709951853 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12710476097 and 12710476106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12710476741) 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, 30981 + ... + 162421.
It is an arithmetic number, because the mean of its divisors is an integer number (887233500).
Almost surely, 212710476141 is an apocalyptic number.
12710476141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12710476141 is a deficient number, since it is larger than the sum of its proper divisors (1485259859).
12710476141 is a wasteful number, since it uses less digits than its factorization.
12710476141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131660.
The product of its (nonzero) digits is 9408, while the sum is 34.
Adding to 12710476141 its reverse (14167401721), we get a palindrome (26877877862).
The spelling of 12710476141 in words is "twelve billion, seven hundred ten million, four hundred seventy-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •