Base | Representation |
---|---|
bin | 1001110001001001110… |
… | …1010000101101100000 |
3 | 121001011012111020022122 |
4 | 2130102131100231200 |
5 | 10222140211310211 |
6 | 205031543123412 |
7 | 15060400144322 |
oct | 2342235205540 |
9 | 531135436278 |
10 | 167813385056 |
11 | 6519530aa89 |
12 | 28634443568 |
13 | 12a94c30ca5 |
14 | 819d4c1612 |
15 | 45728c46db |
hex | 2712750b60 |
167813385056 has 48 divisors (see below), whose sum is σ = 352173427200. Its totient is φ = 78484318848.
The previous prime is 167813385053. The next prime is 167813385083. The reversal of 167813385056 is 650583318761.
It is a happy number.
It is a super-2 number, since 2×1678133850562 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 167813384989 and 167813385007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (167813385053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1698860 + ... + 1794923.
It is an arithmetic number, because the mean of its divisors is an integer number (7336946400).
Almost surely, 2167813385056 is an apocalyptic number.
167813385056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
167813385056 is an abundant number, since it is smaller than the sum of its proper divisors (184360042144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
167813385056 is a wasteful number, since it uses less digits than its factorization.
167813385056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3493891 (or 3493883 counting only the distinct ones).
The product of its (nonzero) digits is 3628800, while the sum is 53.
The spelling of 167813385056 in words is "one hundred sixty-seven billion, eight hundred thirteen million, three hundred eighty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •