Base | Representation |
---|---|
bin | 111100010001011… |
… | …101001110101011 |
3 | 2121110202202011001 |
4 | 330101131032223 |
5 | 4032332143011 |
6 | 244201415431 |
7 | 34026064402 |
oct | 7421351653 |
9 | 2543682131 |
10 | 1011209131 |
11 | 47988a429 |
12 | 24279a577 |
13 | 1316631ca |
14 | 98428639 |
15 | 5db977c1 |
hex | 3c45d3ab |
1011209131 has 8 divisors (see below), whose sum is σ = 1019686400. Its totient is φ = 1002759912.
The previous prime is 1011209107. The next prime is 1011209141. The reversal of 1011209131 is 1319021101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1011209131 - 211 = 1011207083 is a prime.
It is a super-2 number, since 2×10112091312 = 2045087813235550322, 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 = 1011209099 and 1011209108.
It is not an unprimeable number, because it can be changed into a prime (1011209141) 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 7 ways as a sum of consecutive naturals, for example, 68770 + ... + 82168.
It is an arithmetic number, because the mean of its divisors is an integer number (127460800).
Almost surely, 21011209131 is an apocalyptic number.
1011209131 is a deficient number, since it is larger than the sum of its proper divisors (8477269).
1011209131 is a wasteful number, since it uses less digits than its factorization.
1011209131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14025.
The product of its (nonzero) digits is 54, while the sum is 19.
The square root of 1011209131 is about 31799.5146346607. The cubic root of 1011209131 is about 1003.7225027788.
The spelling of 1011209131 in words is "one billion, eleven million, two hundred nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •