Base | Representation |
---|---|
bin | 10111101001011110010… |
… | …10000110000000000000 |
3 | 2212200022022100110000000 |
4 | 23310233022012000000 |
5 | 101303040214302422 |
6 | 1421135320000000 |
7 | 112463332664430 |
oct | 13645712060000 |
9 | 2780268313000 |
10 | 812539994112 |
11 | 2936617099a0 |
12 | 111586000000 |
13 | 5b811c5a232 |
14 | 2b48198a2c0 |
15 | 1620917acac |
hex | bd2f286000 |
812539994112 has 1792 divisors, whose sum is σ = 3301554585600. Its totient is φ = 193491763200.
The previous prime is 812539994087. The next prime is 812539994141. The reversal of 812539994112 is 211499935218.
It is a happy number.
812539994112 is a `hidden beast` number, since 8 + 1 + 2 + 539 + 9 + 94 + 1 + 12 = 666.
It is a tau number, because it is divible by the number of its divisors (1792).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 26210967537 + ... + 26210967567.
Almost surely, 2812539994112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 812539994112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1650777292800).
812539994112 is an abundant number, since it is smaller than the sum of its proper divisors (2489014591488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
812539994112 is an equidigital number, since it uses as much as digits as its factorization.
812539994112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115 (or 73 counting only the distinct ones).
The product of its digits is 1399680, while the sum is 54.
The spelling of 812539994112 in words is "eight hundred twelve billion, five hundred thirty-nine million, nine hundred ninety-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •