Base | Representation |
---|---|
bin | 11110000000111100101… |
… | …10010010101000100011 |
3 | 10122120222011100202222021 |
4 | 33000132112102220203 |
5 | 113344101113423021 |
6 | 2105435010122311 |
7 | 134336415335356 |
oct | 17003626225043 |
9 | 3576864322867 |
10 | 1031301311011 |
11 | 368410782174 |
12 | 147a58880397 |
13 | 7633613754a |
14 | 37cb563429d |
15 | 1bc5e73dc41 |
hex | f01e592a23 |
1031301311011 has 8 divisors (see below), whose sum is σ = 1086279379920. Its totient is φ = 976393147392.
The previous prime is 1031301310999. The next prime is 1031301311069. The reversal of 1031301311011 is 1101131031301.
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 1031301311011 - 225 = 1031267756579 is a prime.
It is a super-3 number, since 3×10313013110113 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1031301311081) 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, 17446030 + ... + 17505043.
It is an arithmetic number, because the mean of its divisors is an integer number (135784922490).
Almost surely, 21031301311011 is an apocalyptic number.
1031301311011 is a deficient number, since it is larger than the sum of its proper divisors (54978068909).
1031301311011 is a wasteful number, since it uses less digits than its factorization.
1031301311011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34952645.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 1031301311011 its reverse (1101131031301), we get a palindrome (2132432342312).
It can be divided in two parts, 103130 and 1311011, that added together give a palindrome (1414141).
The spelling of 1031301311011 in words is "one trillion, thirty-one billion, three hundred one million, three hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •