Base | Representation |
---|---|
bin | 101101011011111101110… |
… | …010000101010001010101 |
3 | 102001111110201000211020201 |
4 | 231123331302011101111 |
5 | 402124140412140313 |
6 | 10350225042300501 |
7 | 441405040162042 |
oct | 55337562052125 |
9 | 12044421024221 |
10 | 3122404021333 |
11 | aa422773a693 |
12 | 425186957731 |
13 | 198597ab03ac |
14 | ab1a76281c9 |
15 | 5634a7b70dd |
hex | 2d6fdc85455 |
3122404021333 has 2 divisors, whose sum is σ = 3122404021334. Its totient is φ = 3122404021332.
The previous prime is 3122404021283. The next prime is 3122404021357. The reversal of 3122404021333 is 3331204042213.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2412998744689 + 709405276644 = 1553383^2 + 842262^2 .
It is a cyclic number.
It is not a de Polignac number, because 3122404021333 - 221 = 3122401924181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3122404021433) 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, 1561202010666 + 1561202010667.
It is an arithmetic number, because the mean of its divisors is an integer number (1561202010667).
Almost surely, 23122404021333 is an apocalyptic number.
It is an amenable number.
3122404021333 is a deficient number, since it is larger than the sum of its proper divisors (1).
3122404021333 is an equidigital number, since it uses as much as digits as its factorization.
3122404021333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 3122404021333 its reverse (3331204042213), we get a palindrome (6453608063546).
The spelling of 3122404021333 in words is "three trillion, one hundred twenty-two billion, four hundred four million, twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •