Base | Representation |
---|---|
bin | 11000000010111011… |
… | …10011011110101101 |
3 | 1020022200111011000120 |
4 | 30001131303132231 |
5 | 202414312222031 |
6 | 5532555115153 |
7 | 634623605220 |
oct | 140135633655 |
9 | 36280434016 |
10 | 12909492141 |
11 | 5525087577 |
12 | 2603442ab9 |
13 | 12a9702860 |
14 | 8a67295b7 |
15 | 508524a96 |
hex | 3017737ad |
12909492141 has 128 divisors (see below), whose sum is σ = 22903136256. Its totient is φ = 6281763840.
The previous prime is 12909492139. The next prime is 12909492151. The reversal of 12909492141 is 14129490921.
It is not a de Polignac number, because 12909492141 - 21 = 12909492139 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 12909492093 and 12909492102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12909492151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 42050310 + ... + 42050616.
It is an arithmetic number, because the mean of its divisors is an integer number (178930752).
Almost surely, 212909492141 is an apocalyptic number.
It is an amenable number.
12909492141 is a deficient number, since it is larger than the sum of its proper divisors (9993644115).
12909492141 is a wasteful number, since it uses less digits than its factorization.
12909492141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571.
The product of its (nonzero) digits is 46656, while the sum is 42.
The spelling of 12909492141 in words is "twelve billion, nine hundred nine million, four hundred ninety-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •