Base | Representation |
---|---|
bin | 10101110101000110110… |
… | …001101101100010110111 |
3 | 12022102002201011210112102 |
4 | 111311012301231202313 |
5 | 144034232020214111 |
6 | 3105052314012315 |
7 | 213244434206624 |
oct | 25650661554267 |
9 | 5272081153472 |
10 | 1500131023031 |
11 | 529224943993 |
12 | 20289aa1709b |
13 | ab6005cc924 |
14 | 5286cc1534b |
15 | 2904db2b13b |
hex | 15d46c6d8b7 |
1500131023031 has 2 divisors, whose sum is σ = 1500131023032. Its totient is φ = 1500131023030.
The previous prime is 1500131023009. The next prime is 1500131023067. The reversal of 1500131023031 is 1303201310051.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1500131023031 is a prime.
It is a super-2 number, since 2×15001310230312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1500131022994 and 1500131023012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1500131023331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 750065511515 + 750065511516.
It is an arithmetic number, because the mean of its divisors is an integer number (750065511516).
Almost surely, 21500131023031 is an apocalyptic number.
1500131023031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1500131023031 is an equidigital number, since it uses as much as digits as its factorization.
1500131023031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 1500131023031 its reverse (1303201310051), we get a palindrome (2803332333082).
The spelling of 1500131023031 in words is "one trillion, five hundred billion, one hundred thirty-one million, twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •