Base | Representation |
---|---|
bin | 11110000000011100011… |
… | …11010000000101100001 |
3 | 10122120021022210002021122 |
4 | 33000032033100011201 |
5 | 113343022420430423 |
6 | 2105352113102025 |
7 | 134326624104410 |
oct | 17001617200541 |
9 | 3576238702248 |
10 | 1031031030113 |
11 | 368292157127 |
12 | 1479a2257915 |
13 | 762c2143916 |
14 | 37c8b799477 |
15 | 1bc45b508c8 |
hex | f00e3d0161 |
1031031030113 has 8 divisors (see below), whose sum is σ = 1178328282432. Its totient is φ = 883735554096.
The previous prime is 1031031030067. The next prime is 1031031030137. The reversal of 1031031030113 is 3110301301301.
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 1031031030113 - 226 = 1030963921249 is a prime.
It is a super-3 number, since 3×10310310301133 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1031031030091 and 1031031030100.
It is not an unprimeable number, because it can be changed into a prime (1031031030413) 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, 1210931 + ... + 1878407.
It is an arithmetic number, because the mean of its divisors is an integer number (147291035304).
Almost surely, 21031031030113 is an apocalyptic number.
It is an amenable number.
1031031030113 is a deficient number, since it is larger than the sum of its proper divisors (147297252319).
1031031030113 is an equidigital number, since it uses as much as digits as its factorization.
1031031030113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 888151.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 1031031030113 its reverse (3110301301301), we get a palindrome (4141332331414).
The spelling of 1031031030113 in words is "one trillion, thirty-one billion, thirty-one million, thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •