Base | Representation |
---|---|
bin | 1000110000111001110… |
… | …00111100101010010101 |
3 | 1001210021102201222022001 |
4 | 10120130320330222111 |
5 | 14413204343320201 |
6 | 350201024235301 |
7 | 30520225115014 |
oct | 4303470745225 |
9 | 1053242658261 |
10 | 301132401301 |
11 | 106789432146 |
12 | 4a44076bb31 |
13 | 22520615554 |
14 | 108096b6a7b |
15 | 7c76ce5301 |
hex | 461ce3ca95 |
301132401301 has 2 divisors, whose sum is σ = 301132401302. Its totient is φ = 301132401300.
The previous prime is 301132401293. The next prime is 301132401319. The reversal of 301132401301 is 103104231103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 276397290225 + 24735111076 = 525735^2 + 157274^2 .
It is a cyclic number.
It is not a de Polignac number, because 301132401301 - 23 = 301132401293 is a prime.
It is a super-2 number, since 2×3011324013012 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (301132401391) 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, 150566200650 + 150566200651.
It is an arithmetic number, because the mean of its divisors is an integer number (150566200651).
Almost surely, 2301132401301 is an apocalyptic number.
It is an amenable number.
301132401301 is a deficient number, since it is larger than the sum of its proper divisors (1).
301132401301 is an equidigital number, since it uses as much as digits as its factorization.
301132401301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 301132401301 its reverse (103104231103), we get a palindrome (404236632404).
The spelling of 301132401301 in words is "three hundred one billion, one hundred thirty-two million, four hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •