Base | Representation |
---|---|
bin | 111100010001111… |
… | …011010000100011 |
3 | 2121110222222212121 |
4 | 330101323100203 |
5 | 4032400112011 |
6 | 244204205111 |
7 | 34030116115 |
oct | 7421732043 |
9 | 2543888777 |
10 | 1011332131 |
11 | 479963887 |
12 | 242839797 |
13 | 1316a71a4 |
14 | 9845b3b5 |
15 | 5dbbde71 |
hex | 3c47b423 |
1011332131 has 8 divisors (see below), whose sum is σ = 1016161200. Its totient is φ = 1006511520.
The previous prime is 1011332099. The next prime is 1011332141. The reversal of 1011332131 is 1312331101.
1011332131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1011332131 - 25 = 1011332099 is a prime.
It is a super-2 number, since 2×10113321312 = 2045585358386002322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011332141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 423561 + ... + 425941.
It is an arithmetic number, because the mean of its divisors is an integer number (127020150).
Almost surely, 21011332131 is an apocalyptic number.
1011332131 is a deficient number, since it is larger than the sum of its proper divisors (4829069).
1011332131 is a wasteful number, since it uses less digits than its factorization.
1011332131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4229.
The product of its (nonzero) digits is 54, while the sum is 16.
The square root of 1011332131 is about 31801.4485676360. The cubic root of 1011332131 is about 1003.7631975796.
Adding to 1011332131 its reverse (1312331101), we get a palindrome (2323663232).
The spelling of 1011332131 in words is "one billion, eleven million, three hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •