Base | Representation |
---|---|
bin | 1011110111010001100010… |
… | …1110001001111011100101 |
3 | 1201012000102211212012100202 |
4 | 2331310120232021323211 |
5 | 3202204040442233222 |
6 | 43424234200120245 |
7 | 2514262122143543 |
oct | 275643056117345 |
9 | 51160384765322 |
10 | 13044230430437 |
11 | 417a033019838 |
12 | 1568086466085 |
13 | 7380b130c54b |
14 | 3314b63aad93 |
15 | 17949c75e892 |
hex | bdd18b89ee5 |
13044230430437 has 2 divisors, whose sum is σ = 13044230430438. Its totient is φ = 13044230430436.
The previous prime is 13044230430403. The next prime is 13044230430457. The reversal of 13044230430437 is 73403403244031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7458410158081 + 5585820272356 = 2731009^2 + 2363434^2 .
It is a cyclic number.
It is not a de Polignac number, because 13044230430437 - 216 = 13044230364901 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13044230430437.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13044230430457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6522115215218 + 6522115215219.
It is an arithmetic number, because the mean of its divisors is an integer number (6522115215219).
Almost surely, 213044230430437 is an apocalyptic number.
It is an amenable number.
13044230430437 is a deficient number, since it is larger than the sum of its proper divisors (1).
13044230430437 is an equidigital number, since it uses as much as digits as its factorization.
13044230430437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 290304, while the sum is 38.
Adding to 13044230430437 its reverse (73403403244031), we get a palindrome (86447633674468).
The spelling of 13044230430437 in words is "thirteen trillion, forty-four billion, two hundred thirty million, four hundred thirty thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •