Base | Representation |
---|---|
bin | 101011101001111110100… |
… | …111000001101011100001 |
3 | 101121210112221121000110201 |
4 | 223221332213001223201 |
5 | 343123010400113241 |
6 | 10214104114225201 |
7 | 426513035402653 |
oct | 53517647015341 |
9 | 11553487530421 |
10 | 3000011332321 |
11 | a57330206933 |
12 | 405509885201 |
13 | 189b90c9a013 |
14 | a52b66066d3 |
15 | 53085731931 |
hex | 2ba7e9c1ae1 |
3000011332321 has 2 divisors, whose sum is σ = 3000011332322. Its totient is φ = 3000011332320.
The previous prime is 3000011332313. The next prime is 3000011332343. The reversal of 3000011332321 is 1232331100003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2290939552225 + 709071780096 = 1513585^2 + 842064^2 .
It is an emirp because it is prime and its reverse (1232331100003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3000011332321 - 23 = 3000011332313 is a prime.
It is not a weakly prime, because it can be changed into another prime (3000011332421) 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, 1500005666160 + 1500005666161.
It is an arithmetic number, because the mean of its divisors is an integer number (1500005666161).
Almost surely, 23000011332321 is an apocalyptic number.
It is an amenable number.
3000011332321 is a deficient number, since it is larger than the sum of its proper divisors (1).
3000011332321 is an equidigital number, since it uses as much as digits as its factorization.
3000011332321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 3000011332321 its reverse (1232331100003), we get a palindrome (4232342432324).
The spelling of 3000011332321 in words is "three trillion, eleven million, three hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •