Base | Representation |
---|---|
bin | 10000000000101111000… |
… | …111110011010100010011 |
3 | 10220012001221201020010021 |
4 | 100000233013303110103 |
5 | 121011404330432011 |
6 | 2201245530444311 |
7 | 142331341255216 |
oct | 20005707632423 |
9 | 3805057636107 |
10 | 1100302202131 |
11 | 3946a99a9a20 |
12 | 1592b4b93697 |
13 | 7c9b15974c2 |
14 | 3b37d69177d |
15 | 1d94c297471 |
hex | 1002f1f3513 |
1100302202131 has 8 divisors (see below), whose sum is σ = 1200337887744. Its totient is φ = 1000267885320.
The previous prime is 1100302202107. The next prime is 1100302202137. The reversal of 1100302202131 is 1312022030011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100302202131 - 29 = 1100302201619 is a prime.
It is a super-2 number, since 2×11003022021312 (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 (1100302202137) 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, 2090550 + ... + 2563396.
It is an arithmetic number, because the mean of its divisors is an integer number (150042235968).
Almost surely, 21100302202131 is an apocalyptic number.
1100302202131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1100302202131 is a deficient number, since it is larger than the sum of its proper divisors (100035685613).
1100302202131 is a wasteful number, since it uses less digits than its factorization.
1100302202131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 684401.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1100302202131 its reverse (1312022030011), we get a palindrome (2412324232142).
The spelling of 1100302202131 in words is "one trillion, one hundred billion, three hundred two million, two hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •