Base | Representation |
---|---|
bin | 10111101001011011000… |
… | …01000100010100111001 |
3 | 2212200020101112200020020 |
4 | 23310231201010110321 |
5 | 101303011142242022 |
6 | 1421132453521053 |
7 | 112462546655325 |
oct | 13645541042471 |
9 | 2780211480206 |
10 | 812512462137 |
11 | 2936481147a2 |
12 | 111578943189 |
13 | 5b80933a71c |
14 | 2b47c060985 |
15 | 16206a3d35c |
hex | bd2d844539 |
812512462137 has 4 divisors (see below), whose sum is σ = 1083349949520. Its totient is φ = 541674974756.
The previous prime is 812512462109. The next prime is 812512462213. The reversal of 812512462137 is 731264215218.
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 812512462137 - 215 = 812512429369 is a prime.
It is a super-2 number, since 2×8125124621372 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (812512462537) 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 3 ways as a sum of consecutive naturals, for example, 135418743687 + ... + 135418743692.
It is an arithmetic number, because the mean of its divisors is an integer number (270837487380).
Almost surely, 2812512462137 is an apocalyptic number.
It is an amenable number.
812512462137 is a deficient number, since it is larger than the sum of its proper divisors (270837487383).
812512462137 is a wasteful number, since it uses less digits than its factorization.
812512462137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270837487382.
The product of its digits is 161280, while the sum is 42.
The spelling of 812512462137 in words is "eight hundred twelve billion, five hundred twelve million, four hundred sixty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •