Base | Representation |
---|---|
bin | 10010111011110000111… |
… | …010100101101101011001 |
3 | 11121101102102121200010202 |
4 | 102323300322211231121 |
5 | 132304144213422131 |
6 | 2433421024151545 |
7 | 163001005432343 |
oct | 22736072455531 |
9 | 4541372550122 |
10 | 1301122014041 |
11 | 461891502a23 |
12 | 1901bb1685b5 |
13 | 959066b5185 |
14 | 46d905b8293 |
15 | 23ca26a8bcb |
hex | 12ef0ea5b59 |
1301122014041 has 2 divisors, whose sum is σ = 1301122014042. Its totient is φ = 1301122014040.
The previous prime is 1301122014011. The next prime is 1301122014077. The reversal of 1301122014041 is 1404102211031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 994050874441 + 307071139600 = 997021^2 + 554140^2 .
It is a cyclic number.
It is not a de Polignac number, because 1301122014041 - 26 = 1301122013977 is a prime.
It is a super-2 number, since 2×13011220140412 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1301122014011) 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, 650561007020 + 650561007021.
It is an arithmetic number, because the mean of its divisors is an integer number (650561007021).
Almost surely, 21301122014041 is an apocalyptic number.
It is an amenable number.
1301122014041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301122014041 is an equidigital number, since it uses as much as digits as its factorization.
1301122014041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1301122014041 its reverse (1404102211031), we get a palindrome (2705224225072).
The spelling of 1301122014041 in words is "one trillion, three hundred one billion, one hundred twenty-two million, fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •