Base | Representation |
---|---|
bin | 10110100110101001… |
… | …01111001001000101 |
3 | 1011022201211022200010 |
4 | 23103110233021011 |
5 | 144323123110031 |
6 | 5324102540433 |
7 | 606503612316 |
oct | 132324571105 |
9 | 34281738603 |
10 | 12135363141 |
11 | 5168106a40 |
12 | 2428137719 |
13 | 11b520a465 |
14 | 8319b660d |
15 | 4b05ad246 |
hex | 2d352f245 |
12135363141 has 32 divisors (see below), whose sum is σ = 18046107648. Its totient is φ = 7191930240.
The previous prime is 12135363133. The next prime is 12135363143. The reversal of 12135363141 is 14136353121.
12135363141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12135363141 - 23 = 12135363133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12135363099 and 12135363108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12135363143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 282876 + ... + 322938.
It is an arithmetic number, because the mean of its divisors is an integer number (563940864).
Almost surely, 212135363141 is an apocalyptic number.
12135363141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12135363141 is a deficient number, since it is larger than the sum of its proper divisors (5910744507).
12135363141 is a wasteful number, since it uses less digits than its factorization.
12135363141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40281.
The product of its digits is 6480, while the sum is 30.
The spelling of 12135363141 in words is "twelve billion, one hundred thirty-five million, three hundred sixty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •