Base | Representation |
---|---|
bin | 101000011100110000… |
… | …011001001010111101 |
3 | 11011002212012100102212 |
4 | 220130300121022331 |
5 | 1202422110333041 |
6 | 31541421030205 |
7 | 3065200636352 |
oct | 503460311275 |
9 | 134085170385 |
10 | 43432121021 |
11 | 174683333a3 |
12 | 85013b5365 |
13 | 41321438c3 |
14 | 216033a629 |
15 | 11e2e868eb |
hex | a1cc192bd |
43432121021 has 4 divisors (see below), whose sum is σ = 43432886844. Its totient is φ = 43431355200.
The previous prime is 43432121017. The next prime is 43432121023. The reversal of 43432121021 is 12012123434.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 36859776121 + 6572344900 = 191989^2 + 81070^2 .
It is a cyclic number.
It is not a de Polignac number, because 43432121021 - 22 = 43432121017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43432121023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 290390 + ... + 413751.
It is an arithmetic number, because the mean of its divisors is an integer number (10858221711).
Almost surely, 243432121021 is an apocalyptic number.
It is an amenable number.
43432121021 is a deficient number, since it is larger than the sum of its proper divisors (765823).
43432121021 is an equidigital number, since it uses as much as digits as its factorization.
43432121021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765822.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 43432121021 its reverse (12012123434), we get a palindrome (55444244455).
The spelling of 43432121021 in words is "forty-three billion, four hundred thirty-two million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •