Base | Representation |
---|---|
bin | 11110000111000010… |
… | …011110001111111101 |
3 | 10002110011020121120201 |
4 | 132013002132033331 |
5 | 1012203031442141 |
6 | 22504035243501 |
7 | 2223114245665 |
oct | 360702361775 |
9 | 102404217521 |
10 | 32330343421 |
11 | 127906aa592 |
12 | 6323449591 |
13 | 308310262c |
14 | 17c9b351a5 |
15 | c934e1031 |
hex | 78709e3fd |
32330343421 has 2 divisors, whose sum is σ = 32330343422. Its totient is φ = 32330343420.
The previous prime is 32330343403. The next prime is 32330343427. The reversal of 32330343421 is 12434303323.
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., 29778679225 + 2551664196 = 172565^2 + 50514^2 .
It is a cyclic number.
It is not a de Polignac number, because 32330343421 - 25 = 32330343389 is a prime.
It is a super-2 number, since 2×323303434212 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 32330343421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32330343427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16165171710 + 16165171711.
It is an arithmetic number, because the mean of its divisors is an integer number (16165171711).
Almost surely, 232330343421 is an apocalyptic number.
It is an amenable number.
32330343421 is a deficient number, since it is larger than the sum of its proper divisors (1).
32330343421 is an equidigital number, since it uses as much as digits as its factorization.
32330343421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 28.
Adding to 32330343421 its reverse (12434303323), we get a palindrome (44764646744).
The spelling of 32330343421 in words is "thirty-two billion, three hundred thirty million, three hundred forty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •