Base | Representation |
---|---|
bin | 101000100000010011… |
… | …0011101011010101101 |
3 | 22022112000011211222010 |
4 | 1101000212131122231 |
5 | 2411120142412314 |
6 | 103543131111433 |
7 | 6166344512652 |
oct | 1210046353255 |
9 | 268460154863 |
10 | 86983169709 |
11 | 33986805917 |
12 | 14a365a2579 |
13 | 8282ac72b7 |
14 | 42d2393c29 |
15 | 23e15b1059 |
hex | 144099d6ad |
86983169709 has 4 divisors (see below), whose sum is σ = 115977559616. Its totient is φ = 57988779804.
The previous prime is 86983169687. The next prime is 86983169737. The reversal of 86983169709 is 90796138968.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 86983169709 - 25 = 86983169677 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 86983169709.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86983169809) 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 3 ways as a sum of consecutive naturals, for example, 14497194949 + ... + 14497194954.
It is an arithmetic number, because the mean of its divisors is an integer number (28994389904).
Almost surely, 286983169709 is an apocalyptic number.
It is an amenable number.
86983169709 is a deficient number, since it is larger than the sum of its proper divisors (28994389907).
86983169709 is a wasteful number, since it uses less digits than its factorization.
86983169709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28994389906.
The product of its (nonzero) digits is 35271936, while the sum is 66.
The spelling of 86983169709 in words is "eighty-six billion, nine hundred eighty-three million, one hundred sixty-nine thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •