Base | Representation |
---|---|
bin | 101000010101101011… |
… | …1100110011100001001 |
3 | 22021121011220011110112 |
4 | 1100223113212130021 |
5 | 2404402444443334 |
6 | 103443524124105 |
7 | 6154460644124 |
oct | 1205327463411 |
9 | 267534804415 |
10 | 86626952969 |
11 | 33813724a17 |
12 | 14957236635 |
13 | 822707556b |
14 | 429ad493bb |
15 | 23c019a4ce |
hex | 142b5e6709 |
86626952969 has 8 divisors (see below), whose sum is σ = 86851239720. Its totient is φ = 86402727936.
The previous prime is 86626952941. The next prime is 86626952981. The reversal of 86626952969 is 96925962668.
It can be written as a sum of positive squares in 4 ways, for example, as 36638936569 + 49988016400 = 191413^2 + 223580^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 86626952969 - 224 = 86610175753 is a prime.
It is a super-2 number, since 2×866269529692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 86626952899 and 86626952908.
It is not an unprimeable number, because it can be changed into a prime (86626952369) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4388129 + ... + 4407825.
It is an arithmetic number, because the mean of its divisors is an integer number (10856404965).
Almost surely, 286626952969 is an apocalyptic number.
It is an amenable number.
86626952969 is a deficient number, since it is larger than the sum of its proper divisors (224286751).
86626952969 is a wasteful number, since it uses less digits than its factorization.
86626952969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30859.
The product of its digits is 151165440, while the sum is 68.
The spelling of 86626952969 in words is "eighty-six billion, six hundred twenty-six million, nine hundred fifty-two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •