Base | Representation |
---|---|
bin | 100110101111110… |
… | …0100001001110101 |
3 | 10100121101221121022 |
4 | 1031133210021311 |
5 | 10130312321211 |
6 | 333002030525 |
7 | 44134560563 |
oct | 11537441165 |
9 | 3317357538 |
10 | 1300120181 |
11 | 60797a598 |
12 | 3034a8445 |
13 | 17947a8a9 |
14 | c4952a33 |
15 | 79215bdb |
hex | 4d7e4275 |
1300120181 has 2 divisors, whose sum is σ = 1300120182. Its totient is φ = 1300120180.
The previous prime is 1300120153. The next prime is 1300120183. The reversal of 1300120181 is 1810210031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1192666225 + 107453956 = 34535^2 + 10366^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1300120181 is a prime.
It is a super-2 number, since 2×13001201812 = 3380624970086945522, which contains 22 as substring.
Together with 1300120183, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1300120183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650060090 + 650060091.
It is an arithmetic number, because the mean of its divisors is an integer number (650060091).
Almost surely, 21300120181 is an apocalyptic number.
It is an amenable number.
1300120181 is a deficient number, since it is larger than the sum of its proper divisors (1).
1300120181 is an equidigital number, since it uses as much as digits as its factorization.
1300120181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
The square root of 1300120181 is about 36057.1793267305. The cubic root of 1300120181 is about 1091.4265139961.
The spelling of 1300120181 in words is "one billion, three hundred million, one hundred twenty thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •