Base | Representation |
---|---|
bin | 10101010010100101… |
… | …00111101110111001 |
3 | 1002111120212120021111 |
4 | 22221102213232321 |
5 | 141402110243213 |
6 | 5130112040321 |
7 | 553151542321 |
oct | 125122475671 |
9 | 32446776244 |
10 | 11430165433 |
11 | 4936037515 |
12 | 226bb330a1 |
13 | 110209b2cb |
14 | 7a6088281 |
15 | 46d710a3d |
hex | 2a94a7bb9 |
11430165433 has 4 divisors (see below), whose sum is σ = 11430484048. Its totient is φ = 11429846820.
The previous prime is 11430165431. The next prime is 11430165451. The reversal of 11430165433 is 33456103411.
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 11430165433 - 21 = 11430165431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11430165395 and 11430165404.
It is not an unprimeable number, because it can be changed into a prime (11430165431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 97503 + ... + 179908.
It is an arithmetic number, because the mean of its divisors is an integer number (2857621012).
Almost surely, 211430165433 is an apocalyptic number.
It is an amenable number.
11430165433 is a deficient number, since it is larger than the sum of its proper divisors (318615).
11430165433 is an equidigital number, since it uses as much as digits as its factorization.
11430165433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318614.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 11430165433 its reverse (33456103411), we get a palindrome (44886268844).
The spelling of 11430165433 in words is "eleven billion, four hundred thirty million, one hundred sixty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •