Base | Representation |
---|---|
bin | 110001110010… |
… | …011000101001 |
3 | 220120002012102 |
4 | 301302120221 |
5 | 11320121213 |
6 | 1143423145 |
7 | 215635553 |
oct | 61623051 |
9 | 26502172 |
10 | 13051433 |
11 | 740480a |
12 | 4454ab5 |
13 | 291c755 |
14 | 1a3a4d3 |
15 | 122c158 |
hex | c72629 |
13051433 has 4 divisors (see below), whose sum is σ = 13235328. Its totient is φ = 12867540.
The previous prime is 13051411. The next prime is 13051453. The reversal of 13051433 is 33415031.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 33415031 = 13 ⋅2570387.
It is a cyclic number.
It is not a de Polignac number, because 13051433 - 28 = 13051177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13051453) 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, 91841 + ... + 91982.
It is an arithmetic number, because the mean of its divisors is an integer number (3308832).
Almost surely, 213051433 is an apocalyptic number.
It is an amenable number.
13051433 is a deficient number, since it is larger than the sum of its proper divisors (183895).
13051433 is an equidigital number, since it uses as much as digits as its factorization.
13051433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183894.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 13051433 is about 3612.6767084808. The cubic root of 13051433 is about 235.4431535326.
Adding to 13051433 its reverse (33415031), we get a palindrome (46466464).
The spelling of 13051433 in words is "thirteen million, fifty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •