Base | Representation |
---|---|
bin | 10111101011011111110… |
… | …01001000111101000000 |
3 | 2212210002222222202101110 |
4 | 23311233321020331000 |
5 | 101312301233200200 |
6 | 1421435154203320 |
7 | 112532261322066 |
oct | 13655771107500 |
9 | 2783088882343 |
10 | 813626068800 |
11 | 294069782986 |
12 | 111829883540 |
13 | 5b955c7378c |
14 | 2b545d02036 |
15 | 1626e6b0b50 |
hex | bd6fe48f40 |
813626068800 has 168 divisors, whose sum is σ = 2677441322272. Its totient is φ = 216311040000.
The previous prime is 813626068747. The next prime is 813626068811. The reversal of 813626068800 is 8860626318.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 813626068800.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1332750 + ... + 1844850.
Almost surely, 2813626068800 is an apocalyptic number.
813626068800 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 813626068800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1338720661136).
813626068800 is an abundant number, since it is smaller than the sum of its proper divisors (1863815253472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
813626068800 is a wasteful number, since it uses less digits than its factorization.
813626068800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 512457 (or 512442 counting only the distinct ones).
The product of its (nonzero) digits is 663552, while the sum is 48.
The spelling of 813626068800 in words is "eight hundred thirteen billion, six hundred twenty-six million, sixty-eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •