Base | Representation |
---|---|
bin | 11000101001011000… |
… | …11101110000110101 |
3 | 1021011011112110011122 |
4 | 30110230131300311 |
5 | 204044404234303 |
6 | 10025001513325 |
7 | 645622005113 |
oct | 142454356065 |
9 | 37134473148 |
10 | 13232102453 |
11 | 56801a4469 |
12 | 26934a2845 |
13 | 132b4b8c2b |
14 | 8d7506ab3 |
15 | 5269ece38 |
hex | 314b1dc35 |
13232102453 has 2 divisors, whose sum is σ = 13232102454. Its totient is φ = 13232102452.
The previous prime is 13232102447. The next prime is 13232102491. The reversal of 13232102453 is 35420123231.
It is a happy number.
13232102453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11968797604 + 1263304849 = 109402^2 + 35543^2 .
It is a cyclic number.
It is not a de Polignac number, because 13232102453 - 24 = 13232102437 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13232102753) 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 as a sum of consecutive naturals, namely, 6616051226 + 6616051227.
It is an arithmetic number, because the mean of its divisors is an integer number (6616051227).
Almost surely, 213232102453 is an apocalyptic number.
It is an amenable number.
13232102453 is a deficient number, since it is larger than the sum of its proper divisors (1).
13232102453 is an equidigital number, since it uses as much as digits as its factorization.
13232102453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 13232102453 its reverse (35420123231), we get a palindrome (48652225684).
The spelling of 13232102453 in words is "thirteen billion, two hundred thirty-two million, one hundred two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •