Base | Representation |
---|---|
bin | 11110000000100100101… |
… | …10011001001100100101 |
3 | 10122120110010120200200110 |
4 | 33000102112121030211 |
5 | 113343143100330201 |
6 | 2105403015403233 |
7 | 134331422325633 |
oct | 17002226311445 |
9 | 3576403520613 |
10 | 1031100011301 |
11 | 368318091778 |
12 | 147a01383519 |
13 | 763035167a9 |
14 | 37c969d4353 |
15 | 1bc4bc296d6 |
hex | f012599325 |
1031100011301 has 16 divisors (see below), whose sum is σ = 1412759744000. Its totient is φ = 668441274048.
The previous prime is 1031100011251. The next prime is 1031100011351.
1031100011301 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (1031100011251) and next prime (1031100011351).
It is not a de Polignac number, because 1031100011301 - 29 = 1031100010789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031100011351) 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 15 ways as a sum of consecutive naturals, for example, 2445226 + ... + 2835723.
It is an arithmetic number, because the mean of its divisors is an integer number (88297484000).
Almost surely, 21031100011301 is an apocalyptic number.
It is an amenable number.
1031100011301 is a deficient number, since it is larger than the sum of its proper divisors (381659732699).
1031100011301 is a wasteful number, since it uses less digits than its factorization.
1031100011301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5282748.
The product of its (nonzero) digits is 9, while the sum is 12.
It can be divided in two parts, 10311000 and 11301, that added together give a palindrome (10322301).
The spelling of 1031100011301 in words is "one trillion, thirty-one billion, one hundred million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •