Base | Representation |
---|---|
bin | 11000010010101010… |
… | …00000100101000111 |
3 | 1020122212200222101112 |
4 | 30021111000211013 |
5 | 203202044413411 |
6 | 5554030315235 |
7 | 641115051452 |
oct | 141125004507 |
9 | 36585628345 |
10 | 13041404231 |
11 | 5592595029 |
12 | 263b658b1b |
13 | 12cab3a74b |
14 | 8ba066499 |
15 | 514dceb8b |
hex | 309540947 |
13041404231 has 2 divisors, whose sum is σ = 13041404232. Its totient is φ = 13041404230.
The previous prime is 13041404227. The next prime is 13041404237. The reversal of 13041404231 is 13240414031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13041404231 - 22 = 13041404227 is a prime.
It is a super-2 number, since 2×130414042312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13041404197 and 13041404206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13041404237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6520702115 + 6520702116.
It is an arithmetic number, because the mean of its divisors is an integer number (6520702116).
Almost surely, 213041404231 is an apocalyptic number.
13041404231 is a deficient number, since it is larger than the sum of its proper divisors (1).
13041404231 is an equidigital number, since it uses as much as digits as its factorization.
13041404231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 13041404231 its reverse (13240414031), we get a palindrome (26281818262).
The spelling of 13041404231 in words is "thirteen billion, forty-one million, four hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •