Base | Representation |
---|---|
bin | 10111101111111110011… |
… | …01011110010111100100 |
3 | 2220000022120102121112220 |
4 | 23313333031132113210 |
5 | 101332212304310114 |
6 | 1422513530312340 |
7 | 112645666104000 |
oct | 13677715362744 |
9 | 2800276377486 |
10 | 816030541284 |
11 | 295092a6a722 |
12 | 11219ab886b0 |
13 | 5bc4a16706a |
14 | 2b6d33a7700 |
15 | 1636081c0a9 |
hex | bdff35e5e4 |
816030541284 has 96 divisors (see below), whose sum is σ = 2221107436800. Its totient is φ = 233086887936.
The previous prime is 816030541279. The next prime is 816030541297. The reversal of 816030541284 is 482145030618.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15932164 + ... + 15983300.
It is an arithmetic number, because the mean of its divisors is an integer number (23136535800).
Almost surely, 2816030541284 is an apocalyptic number.
816030541284 is a gapful number since it is divisible by the number (84) 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 816030541284, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1110553718400).
816030541284 is an abundant number, since it is smaller than the sum of its proper divisors (1405076895516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
816030541284 is a wasteful number, since it uses less digits than its factorization.
816030541284 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55042 (or 55026 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 42.
The spelling of 816030541284 in words is "eight hundred sixteen billion, thirty million, five hundred forty-one thousand, two hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •