Base | Representation |
---|---|
bin | 110000011101001… |
… | …010101110011001 |
3 | 2002122201021010212 |
4 | 300131022232121 |
5 | 3131103434343 |
6 | 212400220505 |
7 | 26100660554 |
oct | 6035125631 |
9 | 2078637125 |
10 | 812952473 |
11 | 387988253 |
12 | 1a830a735 |
13 | cc569588 |
14 | 79d7b69b |
15 | 4b584c18 |
hex | 3074ab99 |
812952473 has 4 divisors (see below), whose sum is σ = 825086160. Its totient is φ = 800818788.
The previous prime is 812952443. The next prime is 812952559. The reversal of 812952473 is 374259218.
812952473 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 812952473 - 26 = 812952409 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 812952473.
It is not an unprimeable number, because it can be changed into a prime (812952403) 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, 6066743 + ... + 6066876.
It is an arithmetic number, because the mean of its divisors is an integer number (206271540).
Almost surely, 2812952473 is an apocalyptic number.
It is an amenable number.
812952473 is a deficient number, since it is larger than the sum of its proper divisors (12133687).
812952473 is a wasteful number, since it uses less digits than its factorization.
812952473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12133686.
The product of its digits is 120960, while the sum is 41.
The square root of 812952473 is about 28512.3214242545. The cubic root of 812952473 is about 933.3009735238.
The spelling of 812952473 in words is "eight hundred twelve million, nine hundred fifty-two thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •