Base | Representation |
---|---|
bin | 10110100101101001… |
… | …10010001100110101 |
3 | 1011022011001202211221 |
4 | 23102310302030311 |
5 | 144314002041221 |
6 | 5323203230341 |
7 | 606342455260 |
oct | 132264621465 |
9 | 34264052757 |
10 | 12126987061 |
11 | 5163405962 |
12 | 24253783b1 |
13 | 11b3566ab7 |
14 | 830835cd7 |
15 | 4ae9a6541 |
hex | 2d2d32335 |
12126987061 has 16 divisors (see below), whose sum is σ = 14928519168. Its totient is φ = 9621889200.
The previous prime is 12126987017. The next prime is 12126987083. The reversal of 12126987061 is 16078962121.
12126987061 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 12126987061 - 225 = 12093432629 is a prime.
It is a super-2 number, since 2×121269870612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12126986999 and 12126987017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12126987361) 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 15 ways as a sum of consecutive naturals, for example, 1209895 + ... + 1219876.
It is an arithmetic number, because the mean of its divisors is an integer number (933032448).
Almost surely, 212126987061 is an apocalyptic number.
It is an amenable number.
12126987061 is a deficient number, since it is larger than the sum of its proper divisors (2801532107).
12126987061 is a wasteful number, since it uses less digits than its factorization.
12126987061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2429832.
The product of its (nonzero) digits is 72576, while the sum is 43.
The spelling of 12126987061 in words is "twelve billion, one hundred twenty-six million, nine hundred eighty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •