Base | Representation |
---|---|
bin | 10011110001001011011101… |
… | …111000011011100001001011 |
3 | 102101211121122212101200221001 |
4 | 103301023131320123201023 |
5 | 42343431114321010042 |
6 | 504524451013555431 |
7 | 24212245655211034 |
oct | 2361133570334113 |
9 | 371747585350831 |
10 | 86942450563147 |
11 | 257800a4837823 |
12 | 9902042945b77 |
13 | 396883a640b1a |
14 | 1768073999a8b |
15 | a0b88cae7bb7 |
hex | 4f12dde1b84b |
86942450563147 has 2 divisors, whose sum is σ = 86942450563148. Its totient is φ = 86942450563146.
The previous prime is 86942450563103. The next prime is 86942450563201. The reversal of 86942450563147 is 74136505424968.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 86942450563147 - 27 = 86942450563019 is a prime.
It is not a weakly prime, because it can be changed into another prime (86642450563147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 43471225281573 + 43471225281574.
It is an arithmetic number, because the mean of its divisors is an integer number (43471225281574).
It is a 1-persistent number, because it is pandigital, but 2⋅86942450563147 = 173884901126294 is not.
Almost surely, 286942450563147 is an apocalyptic number.
86942450563147 is a deficient number, since it is larger than the sum of its proper divisors (1).
86942450563147 is an equidigital number, since it uses as much as digits as its factorization.
86942450563147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174182400, while the sum is 64.
The spelling of 86942450563147 in words is "eighty-six trillion, nine hundred forty-two billion, four hundred fifty million, five hundred sixty-three thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •