Base | Representation |
---|---|
bin | 1110110000001000110011… |
… | …10001100110111000111001 |
3 | 11020212021010201002121111222 |
4 | 13120010121301212320321 |
5 | 13223000234011441213 |
6 | 152554513311001425 |
7 | 6555510244621331 |
oct | 730043161467071 |
9 | 136767121077458 |
10 | 32440320421433 |
11 | a377954184681 |
12 | 377b199809275 |
13 | 1514155892192 |
14 | 802196d780c1 |
15 | 3b3ca937b808 |
hex | 1d8119c66e39 |
32440320421433 has 2 divisors, whose sum is σ = 32440320421434. Its totient is φ = 32440320421432.
The previous prime is 32440320421423. The next prime is 32440320421529. The reversal of 32440320421433 is 33412402304423.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 32436248450089 + 4071971344 = 5695283^2 + 63812^2 .
It is a cyclic number.
It is not a de Polignac number, because 32440320421433 - 28 = 32440320421177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32440320421393 and 32440320421402.
It is not a weakly prime, because it can be changed into another prime (32440320421423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16220160210716 + 16220160210717.
It is an arithmetic number, because the mean of its divisors is an integer number (16220160210717).
Almost surely, 232440320421433 is an apocalyptic number.
It is an amenable number.
32440320421433 is a deficient number, since it is larger than the sum of its proper divisors (1).
32440320421433 is an equidigital number, since it uses as much as digits as its factorization.
32440320421433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 165888, while the sum is 35.
Adding to 32440320421433 its reverse (33412402304423), we get a palindrome (65852722725856).
The spelling of 32440320421433 in words is "thirty-two trillion, four hundred forty billion, three hundred twenty million, four hundred twenty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •