Base | Representation |
---|---|
bin | 110000111010011… |
… | …100000000011001 |
3 | 2010012011002110120 |
4 | 300322130000121 |
5 | 3140040003213 |
6 | 213232503453 |
7 | 26223125655 |
oct | 6072340031 |
9 | 2105132416 |
10 | 820625433 |
11 | 391249041 |
12 | 1aa9aab89 |
13 | 101024ba4 |
14 | 7adb7a65 |
15 | 4c09d423 |
hex | 30e9c019 |
820625433 has 4 divisors (see below), whose sum is σ = 1094167248. Its totient is φ = 547083620.
The previous prime is 820625423. The next prime is 820625501. The reversal of 820625433 is 334526028.
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 cyclic number.
It is not a de Polignac number, because 820625433 - 24 = 820625417 is a prime.
It is a super-2 number, since 2×8206254332 = 1346852202572874978, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 820625394 and 820625403.
It is not an unprimeable number, because it can be changed into a prime (820625423) 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, 136770903 + ... + 136770908.
It is an arithmetic number, because the mean of its divisors is an integer number (273541812).
Almost surely, 2820625433 is an apocalyptic number.
It is an amenable number.
820625433 is a deficient number, since it is larger than the sum of its proper divisors (273541815).
820625433 is a wasteful number, since it uses less digits than its factorization.
820625433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273541814.
The product of its (nonzero) digits is 34560, while the sum is 33.
The square root of 820625433 is about 28646.5605788897. The cubic root of 820625433 is about 936.2280689668.
The spelling of 820625433 in words is "eight hundred twenty million, six hundred twenty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •