Base | Representation |
---|---|
bin | 11000010010100000… |
… | …01100100001100001 |
3 | 1020122210022212112021 |
4 | 30021100030201201 |
5 | 203201234024213 |
6 | 5553543301441 |
7 | 641101244653 |
oct | 141120144141 |
9 | 36583285467 |
10 | 13040142433 |
11 | 559190301a |
12 | 263b14a881 |
13 | 12ca7b8316 |
14 | 8b9c186d3 |
15 | 514c30d8d |
hex | 30940c861 |
13040142433 has 4 divisors (see below), whose sum is σ = 13317592320. Its totient is φ = 12762692548.
The previous prime is 13040142403. The next prime is 13040142439. The reversal of 13040142433 is 33424104031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13040142433 - 213 = 13040134241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13040142398 and 13040142407.
It is not an unprimeable number, because it can be changed into a prime (13040142439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 138724873 + ... + 138724966.
It is an arithmetic number, because the mean of its divisors is an integer number (3329398080).
Almost surely, 213040142433 is an apocalyptic number.
It is an amenable number.
13040142433 is a deficient number, since it is larger than the sum of its proper divisors (277449887).
13040142433 is an equidigital number, since it uses as much as digits as its factorization.
13040142433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277449886.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 13040142433 its reverse (33424104031), we get a palindrome (46464246464).
The spelling of 13040142433 in words is "thirteen billion, forty million, one hundred forty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •