Base | Representation |
---|---|
bin | 100001111100000010101… |
… | …111000101111110101101 |
3 | 22020221211221111000101002 |
4 | 201330002233011332231 |
5 | 301202333031011141 |
6 | 4543223125330045 |
7 | 330332262420542 |
oct | 41740257057655 |
9 | 8227757430332 |
10 | 2332213141421 |
11 | 81a0a4577009 |
12 | 317bb9566925 |
13 | 13bc0810b0b7 |
14 | 80c45d38bc9 |
15 | 409ed72ae9b |
hex | 21f02bc5fad |
2332213141421 has 2 divisors, whose sum is σ = 2332213141422. Its totient is φ = 2332213141420.
The previous prime is 2332213141409. The next prime is 2332213141469. The reversal of 2332213141421 is 1241413122332.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1718356561321 + 613856580100 = 1310861^2 + 783490^2 .
It is a cyclic number.
It is not a de Polignac number, because 2332213141421 - 238 = 2057335234477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2332213141481) 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, 1166106570710 + 1166106570711.
It is an arithmetic number, because the mean of its divisors is an integer number (1166106570711).
Almost surely, 22332213141421 is an apocalyptic number.
It is an amenable number.
2332213141421 is a deficient number, since it is larger than the sum of its proper divisors (1).
2332213141421 is an equidigital number, since it uses as much as digits as its factorization.
2332213141421 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 29.
Adding to 2332213141421 its reverse (1241413122332), we get a palindrome (3573626263753).
The spelling of 2332213141421 in words is "two trillion, three hundred thirty-two billion, two hundred thirteen million, one hundred forty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •