Base | Representation |
---|---|
bin | 10010111010110000000… |
… | …000011100101111011011 |
3 | 11121021121112111121102101 |
4 | 102322300000130233123 |
5 | 132244431423444011 |
6 | 2433121003344231 |
7 | 162632013303142 |
oct | 22726000345733 |
9 | 4537545447371 |
10 | 1300033031131 |
11 | 461382832a4a |
12 | 18bb56522077 |
13 | 95791bc0ca3 |
14 | 46cc9b06759 |
15 | 23c3bc9c2c1 |
hex | 12eb001cbdb |
1300033031131 has 8 divisors (see below), whose sum is σ = 1380195932544. Its totient is φ = 1220280170880.
The previous prime is 1300033031123. The next prime is 1300033031137. The reversal of 1300033031131 is 1311303300031.
It is a happy number.
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 1300033031131 - 23 = 1300033031123 is a prime.
It is a super-2 number, since 2×13000330311312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1300033031099 and 1300033031108.
It is not an unprimeable number, because it can be changed into a prime (1300033031137) 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, 102503755 + ... + 102516436.
It is an arithmetic number, because the mean of its divisors is an integer number (172524491568).
Almost surely, 21300033031131 is an apocalyptic number.
1300033031131 is a deficient number, since it is larger than the sum of its proper divisors (80162901413).
1300033031131 is a wasteful number, since it uses less digits than its factorization.
1300033031131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205020581.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 1300033031131 its reverse (1311303300031), we get a palindrome (2611336331162).
The spelling of 1300033031131 in words is "one trillion, three hundred billion, thirty-three million, thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •