Base | Representation |
---|---|
bin | 1001100010110101100… |
… | …1110011001001101010 |
3 | 120200020101102012022100 |
4 | 2120231121303021222 |
5 | 10141302421320312 |
6 | 203154344434230 |
7 | 14563225132422 |
oct | 2305531631152 |
9 | 520211365270 |
10 | 163970495082 |
11 | 635a3084959 |
12 | 27941478976 |
13 | 12601a2a7b4 |
14 | 7d16d87482 |
15 | 43ea3355dc |
hex | 262d67326a |
163970495082 has 12 divisors (see below), whose sum is σ = 355269406050. Its totient is φ = 54656831688.
The previous prime is 163970495077. The next prime is 163970495099. The reversal of 163970495082 is 280594079361.
163970495082 is a `hidden beast` number, since 1 + 6 + 3 + 9 + 70 + 495 + 0 + 82 = 666.
163970495082 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 114094652841 + 49875842241 = 337779^2 + 223329^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4554735957 + ... + 4554735992.
It is a 1-persistent number, because it is pandigital, but 2⋅163970495082 = 327940990164 is not.
Almost surely, 2163970495082 is an apocalyptic number.
163970495082 is an abundant number, since it is smaller than the sum of its proper divisors (191298910968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163970495082 is a wasteful number, since it uses less digits than its factorization.
163970495082 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9109471957 (or 9109471954 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 54.
The spelling of 163970495082 in words is "one hundred sixty-three billion, nine hundred seventy million, four hundred ninety-five thousand, eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.639 sec. • engine limits •