Base | Representation |
---|---|
bin | 1111011001001111… |
… | …1100101011110001 |
3 | 101122222212220121210 |
4 | 3312103330223301 |
5 | 31430400040213 |
6 | 1522020110333 |
7 | 204256012434 |
oct | 36623745361 |
9 | 11588786553 |
10 | 4132424433 |
11 | 1830711705 |
12 | 973b353a9 |
13 | 50b1a8877 |
14 | 2b2b8581b |
15 | 192bd20c3 |
hex | f64fcaf1 |
4132424433 has 4 divisors (see below), whose sum is σ = 5509899248. Its totient is φ = 2754949620.
The previous prime is 4132424389. The next prime is 4132424453. The reversal of 4132424433 is 3344242314.
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.
It is not a de Polignac number, because 4132424433 - 213 = 4132416241 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4132424433.
It is not an unprimeable number, because it can be changed into a prime (4132424453) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 688737403 + ... + 688737408.
It is an arithmetic number, because the mean of its divisors is an integer number (1377474812).
Almost surely, 24132424433 is an apocalyptic number.
It is an amenable number.
4132424433 is a deficient number, since it is larger than the sum of its proper divisors (1377474815).
4132424433 is a wasteful number, since it uses less digits than its factorization.
4132424433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1377474814.
The product of its digits is 27648, while the sum is 30.
The square root of 4132424433 is about 64283.9360415960. The cubic root of 4132424433 is about 1604.7287751237.
Adding to 4132424433 its reverse (3344242314), we get a palindrome (7476666747).
The spelling of 4132424433 in words is "four billion, one hundred thirty-two million, four hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •