Base | Representation |
---|---|
bin | 101111101100010… |
… | …000000111111101 |
3 | 2001202120210101011 |
4 | 233230100013331 |
5 | 3114313121113 |
6 | 211221315221 |
7 | 25553663110 |
oct | 5754200775 |
9 | 2052523334 |
10 | 800129533 |
11 | 38071a185 |
12 | 1a3b65b11 |
13 | c99c9b38 |
14 | 783a0577 |
15 | 4a3a063d |
hex | 2fb101fd |
800129533 has 4 divisors (see below), whose sum is σ = 914433760. Its totient is φ = 685825308.
The previous prime is 800129527. The next prime is 800129537. The reversal of 800129533 is 335921008.
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 a de Polignac number, because none of the positive numbers 2k-800129533 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 800129495 and 800129504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (800129537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57152103 + ... + 57152116.
It is an arithmetic number, because the mean of its divisors is an integer number (228608440).
Almost surely, 2800129533 is an apocalyptic number.
It is an amenable number.
800129533 is a deficient number, since it is larger than the sum of its proper divisors (114304227).
800129533 is a wasteful number, since it uses less digits than its factorization.
800129533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114304226.
The product of its (nonzero) digits is 6480, while the sum is 31.
The square root of 800129533 is about 28286.5609963460. The cubic root of 800129533 is about 928.3678672625.
The spelling of 800129533 in words is "eight hundred million, one hundred twenty-nine thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •