Base | Representation |
---|---|
bin | 11110000000111111000… |
… | …10100101101100001011 |
3 | 10122121000112222221012001 |
4 | 33000133202211230023 |
5 | 113344121223441021 |
6 | 2105441002531431 |
7 | 134340050340334 |
oct | 17003742455413 |
9 | 3577015887161 |
10 | 1031321312011 |
11 | 368420aa3221 |
12 | 147a63506b77 |
13 | 7633a31b263 |
14 | 37cb815d28b |
15 | 1bc61390091 |
hex | f01f8a5b0b |
1031321312011 has 16 divisors (see below), whose sum is σ = 1040137413120. Its totient is φ = 1022544760320.
The previous prime is 1031321312009. The next prime is 1031321312041. The reversal of 1031321312011 is 1102131231301.
1031321312011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1031321312011 - 21 = 1031321312009 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1031321312011.
It is not an unprimeable number, because it can be changed into a prime (1031321312041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 123109255 + ... + 123117631.
It is an arithmetic number, because the mean of its divisors is an integer number (65008588320).
Almost surely, 21031321312011 is an apocalyptic number.
1031321312011 is a deficient number, since it is larger than the sum of its proper divisors (8816101109).
1031321312011 is a wasteful number, since it uses less digits than its factorization.
1031321312011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10614.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1031321312011 its reverse (1102131231301), we get a palindrome (2133452543312).
The spelling of 1031321312011 in words is "one trillion, thirty-one billion, three hundred twenty-one million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •