Base | Representation |
---|---|
bin | 10101010011101001101… |
… | …00101010000100111101 |
3 | 2120222200121120221212201 |
4 | 22221310310222010331 |
5 | 43443322211314323 |
6 | 1320154002031501 |
7 | 103615141506613 |
oct | 12516464520475 |
9 | 2528617527781 |
10 | 732104401213 |
11 | 262535937489 |
12 | b9a78348591 |
13 | 54063801253 |
14 | 276110236b3 |
15 | 1409c8178ad |
hex | aa74d2a13d |
732104401213 has 2 divisors, whose sum is σ = 732104401214. Its totient is φ = 732104401212.
The previous prime is 732104401177. The next prime is 732104401241. The reversal of 732104401213 is 312104401237.
732104401213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (732104401241) can be obtained adding 732104401213 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 416931072804 + 315173328409 = 645702^2 + 561403^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-732104401213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (732104401253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 366052200606 + 366052200607.
It is an arithmetic number, because the mean of its divisors is an integer number (366052200607).
Almost surely, 2732104401213 is an apocalyptic number.
It is an amenable number.
732104401213 is a deficient number, since it is larger than the sum of its proper divisors (1).
732104401213 is an equidigital number, since it uses as much as digits as its factorization.
732104401213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4032, while the sum is 28.
The spelling of 732104401213 in words is "seven hundred thirty-two billion, one hundred four million, four hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •