Base | Representation |
---|---|
bin | 10111101000101110001… |
… | …01010000101001100101 |
3 | 2212122021011022011112112 |
4 | 23310113011100221211 |
5 | 101301223313330304 |
6 | 1421031250330405 |
7 | 112450326504323 |
oct | 13642705205145 |
9 | 2778234264475 |
10 | 812136073829 |
11 | 293474706683 |
12 | 111492889a05 |
13 | 5b779375452 |
14 | 2b444084d13 |
15 | 161d3990b6e |
hex | bd17150a65 |
812136073829 has 8 divisors (see below), whose sum is σ = 862847274360. Its totient is φ = 762938640576.
The previous prime is 812136073811. The next prime is 812136073883. The reversal of 812136073829 is 928370631218.
It can be written as a sum of positive squares in 4 ways, for example, as 479420529604 + 332715544225 = 692402^2 + 576815^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-812136073829 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (812136003829) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 378440714 + ... + 378442859.
It is an arithmetic number, because the mean of its divisors is an integer number (107855909295).
Almost surely, 2812136073829 is an apocalyptic number.
It is an amenable number.
812136073829 is a deficient number, since it is larger than the sum of its proper divisors (50711200531).
812136073829 is a wasteful number, since it uses less digits than its factorization.
812136073829 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 756883639.
The product of its (nonzero) digits is 870912, while the sum is 50.
The spelling of 812136073829 in words is "eight hundred twelve billion, one hundred thirty-six million, seventy-three thousand, eight hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •