Base | Representation |
---|---|
bin | 10000001100100100000… |
… | …101101011111100000011 |
3 | 10221101212000121210212011 |
4 | 100030210011223330003 |
5 | 121213412003001011 |
6 | 2211150035313351 |
7 | 143261140622320 |
oct | 20144405537403 |
9 | 3841760553764 |
10 | 1113002000131 |
11 | 39a02668214a |
12 | 15b85a14b857 |
13 | 80c566ca488 |
14 | 3bc261d3b47 |
15 | 1de4219a621 |
hex | 1032416bf03 |
1113002000131 has 8 divisors (see below), whose sum is σ = 1274353495904. Its totient is φ = 952238306880.
The previous prime is 1113002000119. The next prime is 1113002000183. The reversal of 1113002000131 is 1310002003111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1113002000131 - 221 = 1112999902979 is a prime.
It is a super-2 number, since 2×11130020001312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113002000191) 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 7 ways as a sum of consecutive naturals, for example, 146946570 + ... + 146954143.
It is an arithmetic number, because the mean of its divisors is an integer number (159294186988).
Almost surely, 21113002000131 is an apocalyptic number.
1113002000131 is a deficient number, since it is larger than the sum of its proper divisors (161351495773).
1113002000131 is an equidigital number, since it uses as much as digits as its factorization.
1113002000131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293901261.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1113002000131 its reverse (1310002003111), we get a palindrome (2423004003242).
The spelling of 1113002000131 in words is "one trillion, one hundred thirteen billion, two million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •