Base | Representation |
---|---|
bin | 11101000111001101001… |
… | …01100010100001101001 |
3 | 10112121221200211110211021 |
4 | 32203212211202201221 |
5 | 112342104024404342 |
6 | 2043310522132441 |
7 | 132161251215151 |
oct | 16434645424151 |
9 | 3477850743737 |
10 | 1000301013097 |
11 | 356252931551 |
12 | 141a46951121 |
13 | 7343575c7b9 |
14 | 365b4401761 |
15 | 1b047dc5567 |
hex | e8e6962869 |
1000301013097 has 2 divisors, whose sum is σ = 1000301013098. Its totient is φ = 1000301013096.
The previous prime is 1000301013091. The next prime is 1000301013169. The reversal of 1000301013097 is 7903101030001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 803396712976 + 196904300121 = 896324^2 + 443739^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000301013097 is a prime.
It is not a weakly prime, because it can be changed into another prime (1000301013091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500150506548 + 500150506549.
It is an arithmetic number, because the mean of its divisors is an integer number (500150506549).
Almost surely, 21000301013097 is an apocalyptic number.
It is an amenable number.
1000301013097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000301013097 is an equidigital number, since it uses as much as digits as its factorization.
1000301013097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 25.
Adding to 1000301013097 its reverse (7903101030001), we get a palindrome (8903402043098).
The spelling of 1000301013097 in words is "one trillion, three hundred one million, thirteen thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •