Base | Representation |
---|---|
bin | 10011101100110100011100… |
… | …11101010111111101010001 |
3 | 12200101111011221211220101022 |
4 | 21312122032131113331101 |
5 | 21134234242113244213 |
6 | 232045331300445225 |
7 | 12060604266034562 |
oct | 1166321635277521 |
9 | 180344157756338 |
10 | 43321430212433 |
11 | 12892573a7090a |
12 | 4a37b973a9815 |
13 | 1b232689ca229 |
14 | a9aaa8734169 |
15 | 501d531ec308 |
hex | 27668e757f51 |
43321430212433 has 2 divisors, whose sum is σ = 43321430212434. Its totient is φ = 43321430212432.
The previous prime is 43321430212399. The next prime is 43321430212447. The reversal of 43321430212433 is 33421203412334.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36386676786769 + 6934753425664 = 6032137^2 + 2633392^2 .
It is a cyclic number.
It is not a de Polignac number, because 43321430212433 - 236 = 43252710735697 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 43321430212393 and 43321430212402.
It is not a weakly prime, because it can be changed into another prime (43321430212033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21660715106216 + 21660715106217.
It is an arithmetic number, because the mean of its divisors is an integer number (21660715106217).
Almost surely, 243321430212433 is an apocalyptic number.
It is an amenable number.
43321430212433 is a deficient number, since it is larger than the sum of its proper divisors (1).
43321430212433 is an equidigital number, since it uses as much as digits as its factorization.
43321430212433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 43321430212433 its reverse (33421203412334), we get a palindrome (76742633624767).
The spelling of 43321430212433 in words is "forty-three trillion, three hundred twenty-one billion, four hundred thirty million, two hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •