Base | Representation |
---|---|
bin | 10111101000110111100… |
… | …01010001110001001000 |
3 | 2212122110122021220000020 |
4 | 23310123301101301020 |
5 | 101301403432042413 |
6 | 1421043140140440 |
7 | 112452303136203 |
oct | 13643361216110 |
9 | 2778418256006 |
10 | 812214721608 |
11 | 293505043944 |
12 | 1114b5097720 |
13 | 5b78c7511b4 |
14 | 2b4506b893a |
15 | 161da828c23 |
hex | bd1bc51c48 |
812214721608 has 32 divisors (see below), whose sum is σ = 2077758592800. Its totient is φ = 264442002048.
The previous prime is 812214721607. The next prime is 812214721609. The reversal of 812214721608 is 806127412218.
It is an interprime number because it is at equal distance from previous prime (812214721607) and next prime (812214721609).
It is a self number, because there is not a number n which added to its sum of digits gives 812214721608.
It is not an unprimeable number, because it can be changed into a prime (812214721607) 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, 393513853 + ... + 393515916.
It is an arithmetic number, because the mean of its divisors is an integer number (64929956025).
Almost surely, 2812214721608 is an apocalyptic number.
It is an amenable number.
812214721608 is an abundant number, since it is smaller than the sum of its proper divisors (1265543871192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
812214721608 is a wasteful number, since it uses less digits than its factorization.
812214721608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787029821 (or 787029817 counting only the distinct ones).
The product of its (nonzero) digits is 86016, while the sum is 42.
The spelling of 812214721608 in words is "eight hundred twelve billion, two hundred fourteen million, seven hundred twenty-one thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •