Base | Representation |
---|---|
bin | 111100011000001… |
… | …111110011010101 |
3 | 2121121010011212100 |
4 | 330120033303111 |
5 | 4033311123031 |
6 | 244303512313 |
7 | 34050160053 |
oct | 7430176325 |
9 | 2547104770 |
10 | 1012989141 |
11 | 47a89580a |
12 | 2432b8699 |
13 | 131b37478 |
14 | 9876d1d3 |
15 | 5dde9de6 |
hex | 3c60fcd5 |
1012989141 has 24 divisors (see below), whose sum is σ = 1499697056. Its totient is φ = 658536480.
The previous prime is 1012989059. The next prime is 1012989143. The reversal of 1012989141 is 1419892101.
It is not a de Polignac number, because 1012989141 - 210 = 1012988117 is a prime.
It is a super-2 number, since 2×10129891412 = 2052293999567835762, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012989096 and 1012989105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012989143) 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 23 ways as a sum of consecutive naturals, for example, 281886 + ... + 285456.
Almost surely, 21012989141 is an apocalyptic number.
It is an amenable number.
1012989141 is a deficient number, since it is larger than the sum of its proper divisors (486707915).
1012989141 is a wasteful number, since it uses less digits than its factorization.
1012989141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4353 (or 4350 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 36.
The square root of 1012989141 is about 31827.4903346148. The cubic root of 1012989141 is about 1004.3111013636.
The spelling of 1012989141 in words is "one billion, twelve million, nine hundred eighty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •