Base | Representation |
---|---|
bin | 111011011100010111010… |
… | …1001010111000001110001 |
3 | 1001221000201010121001112201 |
4 | 1312320232221113001301 |
5 | 2032323232430004103 |
6 | 25213054210023201 |
7 | 1502151342346015 |
oct | 166705651270161 |
9 | 31830633531481 |
10 | 8169810391153 |
11 | 266a884a85484 |
12 | abb444b77b01 |
13 | 473543491858 |
14 | 2035c707a545 |
15 | e27aed0a51d |
hex | 76e2ea57071 |
8169810391153 has 16 divisors (see below), whose sum is σ = 8708941024000. Its totient is φ = 7641600175872.
The previous prime is 8169810391123. The next prime is 8169810391201. The reversal of 8169810391153 is 3511930189618.
It is a cyclic number.
It is not a de Polignac number, because 8169810391153 - 29 = 8169810390641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8169810391094 and 8169810391103.
It is not an unprimeable number, because it can be changed into a prime (8169810391123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59715001 + ... + 59851657.
It is an arithmetic number, because the mean of its divisors is an integer number (544308814000).
Almost surely, 28169810391153 is an apocalyptic number.
It is an amenable number.
8169810391153 is a deficient number, since it is larger than the sum of its proper divisors (539130632847).
8169810391153 is a wasteful number, since it uses less digits than its factorization.
8169810391153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176584.
The product of its (nonzero) digits is 1399680, while the sum is 55.
The spelling of 8169810391153 in words is "eight trillion, one hundred sixty-nine billion, eight hundred ten million, three hundred ninety-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •