Base | Representation |
---|---|
bin | 1000101110110010111… |
… | …10001110000000110101 |
3 | 1001200100121102010211112 |
4 | 10113121132032000311 |
5 | 14403400314233023 |
6 | 345452501244405 |
7 | 30450212103602 |
oct | 4273136160065 |
9 | 1050317363745 |
10 | 300001321013 |
11 | 106258a19849 |
12 | 4a185a03705 |
13 | 223a01a1c84 |
14 | 1073d3a76a9 |
15 | 7c0c870478 |
hex | 45d978e035 |
300001321013 has 2 divisors, whose sum is σ = 300001321014. Its totient is φ = 300001321012.
The previous prime is 300001321003. The next prime is 300001321051. The reversal of 300001321013 is 310123100003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 204450474244 + 95550846769 = 452162^2 + 309113^2 .
It is a cyclic number.
It is not a de Polignac number, because 300001321013 - 28 = 300001320757 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300001321003) 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, 150000660506 + 150000660507.
It is an arithmetic number, because the mean of its divisors is an integer number (150000660507).
Almost surely, 2300001321013 is an apocalyptic number.
It is an amenable number.
300001321013 is a deficient number, since it is larger than the sum of its proper divisors (1).
300001321013 is an equidigital number, since it uses as much as digits as its factorization.
300001321013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 300001321013 its reverse (310123100003), we get a palindrome (610124421016).
The spelling of 300001321013 in words is "three hundred billion, one million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •