Base | Representation |
---|---|
bin | 101000000111010111… |
… | …0010001111100001001 |
3 | 22020100200120110112201 |
4 | 1100032232101330021 |
5 | 2402411431442144 |
6 | 103324115240201 |
7 | 6136533653512 |
oct | 1201656217411 |
9 | 266320513481 |
10 | 86146359049 |
11 | 33597412663 |
12 | 148422a9061 |
13 | 817b62646a |
14 | 42531a5a09 |
15 | 2392db71d4 |
hex | 140eb91f09 |
86146359049 has 3 divisors (see below), whose sum is σ = 86146652557. Its totient is φ = 86146065542.
The previous prime is 86146359037. The next prime is 86146359097. The reversal of 86146359049 is 94095364168.
It is a happy number.
The square root of 86146359049 is 293507.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 86146359049 - 211 = 86146357001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (86146359449) 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 2 ways as a sum of consecutive naturals, for example, 146754 + ... + 440260.
Almost surely, 286146359049 is an apocalyptic number.
86146359049 is the 293507-th square number.
86146359049 is the 146754-th centered octagonal number.
It is an amenable number.
86146359049 is a deficient number, since it is larger than the sum of its proper divisors (293508).
86146359049 is an frugal number, since it uses more digits than its factorization.
86146359049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 587014 (or 293507 counting only the distinct ones).
The product of its (nonzero) digits is 5598720, while the sum is 55.
The spelling of 86146359049 in words is "eighty-six billion, one hundred forty-six million, three hundred fifty-nine thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •