Base | Representation |
---|---|
bin | 101011101011001011100… |
… | …010111101101100010001 |
3 | 101121220212220102110202001 |
4 | 223223023202331230101 |
5 | 343133131320104131 |
6 | 10214440144154001 |
7 | 426560031015031 |
oct | 53531342755421 |
9 | 11556786373661 |
10 | 3001302113041 |
11 | a57932887561 |
12 | 40580a008901 |
13 | 18a0385278ab |
14 | a5399c078c1 |
15 | 5310dc00261 |
hex | 2bacb8bdb11 |
3001302113041 has 2 divisors, whose sum is σ = 3001302113042. Its totient is φ = 3001302113040.
The previous prime is 3001302113003. The next prime is 3001302113093. The reversal of 3001302113041 is 1403112031003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2326604153041 + 674697960000 = 1525321^2 + 821400^2 .
It is an emirp because it is prime and its reverse (1403112031003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3001302113041 - 229 = 3000765242129 is a prime.
It is not a weakly prime, because it can be changed into another prime (3001302713041) 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, 1500651056520 + 1500651056521.
It is an arithmetic number, because the mean of its divisors is an integer number (1500651056521).
Almost surely, 23001302113041 is an apocalyptic number.
It is an amenable number.
3001302113041 is a deficient number, since it is larger than the sum of its proper divisors (1).
3001302113041 is an equidigital number, since it uses as much as digits as its factorization.
3001302113041 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 3001302113041 its reverse (1403112031003), we get a palindrome (4404414144044).
The spelling of 3001302113041 in words is "three trillion, one billion, three hundred two million, one hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •