Base | Representation |
---|---|
bin | 1001100101010… |
… | …01100110000001 |
3 | 12121021001110022 |
4 | 10302221212001 |
5 | 131034331213 |
6 | 11550543225 |
7 | 1664162531 |
oct | 462514601 |
9 | 177231408 |
10 | 80386433 |
11 | 41415576 |
12 | 22b07b15 |
13 | 1386724a |
14 | a9674c1 |
15 | 70cd308 |
hex | 4ca9981 |
80386433 has 4 divisors (see below), whose sum is σ = 80670768. Its totient is φ = 80102100.
The previous prime is 80386417. The next prime is 80386451. The reversal of 80386433 is 33468308.
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 80386433 - 24 = 80386417 is a prime.
It is a super-2 number, since 2×803864332 = 12923957220926978, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 80386393 and 80386402.
It is not an unprimeable number, because it can be changed into a prime (80386483) 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, 141743 + ... + 142308.
It is an arithmetic number, because the mean of its divisors is an integer number (20167692).
Almost surely, 280386433 is an apocalyptic number.
It is an amenable number.
80386433 is a deficient number, since it is larger than the sum of its proper divisors (284335).
80386433 is a wasteful number, since it uses less digits than its factorization.
80386433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284334.
The product of its (nonzero) digits is 41472, while the sum is 35.
The square root of 80386433 is about 8965.8481472753. The cubic root of 80386433 is about 431.5796111189.
The spelling of 80386433 in words is "eighty million, three hundred eighty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •