Base | Representation |
---|---|
bin | 11000100110011101100… |
… | …10000000110010111000 |
3 | 2222210211012201200021110 |
4 | 30103032302000302320 |
5 | 102322114344310333 |
6 | 1444152332040320 |
7 | 115032616211265 |
oct | 14231662006270 |
9 | 2883735650243 |
10 | 845282806968 |
11 | 2a6534120906 |
12 | 1179a36030a0 |
13 | 6192c648a02 |
14 | 2ccaa3b026c |
15 | 16ec3995063 |
hex | c4cec80cb8 |
845282806968 has 32 divisors (see below), whose sum is σ = 2114433590400. Its totient is φ = 281597392608.
The previous prime is 845282806967. The next prime is 845282806997. The reversal of 845282806968 is 869608282548.
It is a super-2 number, since 2×8452828069682 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 845282806899 and 845282806908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (845282806967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10179228 + ... + 10261931.
It is an arithmetic number, because the mean of its divisors is an integer number (66076049700).
Almost surely, 2845282806968 is an apocalyptic number.
It is an amenable number.
845282806968 is an abundant number, since it is smaller than the sum of its proper divisors (1269150783432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
845282806968 is a wasteful number, since it uses less digits than its factorization.
845282806968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20442891 (or 20442887 counting only the distinct ones).
The product of its (nonzero) digits is 106168320, while the sum is 66.
The spelling of 845282806968 in words is "eight hundred forty-five billion, two hundred eighty-two million, eight hundred six thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •