Base | Representation |
---|---|
bin | 101000010001011010… |
… | …0001000101110000100 |
3 | 22021020011211212120122 |
4 | 1100202310020232010 |
5 | 2404104230012333 |
6 | 103421400121112 |
7 | 6151066045400 |
oct | 1204264105604 |
9 | 267204755518 |
10 | 86483438468 |
11 | 3374a712399 |
12 | 14917166198 |
13 | 820340763b |
14 | 4285c6c100 |
15 | 23b279c798 |
hex | 1422d08b84 |
86483438468 has 72 divisors (see below), whose sum is σ = 178283286720. Its totient is φ = 36597355200.
The previous prime is 86483438443. The next prime is 86483438527.
86483438468 is nontrivially palindromic in base 10.
It is a self number, because there is not a number n which added to its sum of digits gives 86483438468.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7496921 + ... + 7508447.
It is an arithmetic number, because the mean of its divisors is an integer number (2476156760).
Almost surely, 286483438468 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 86483438468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89141643360).
86483438468 is an abundant number, since it is smaller than the sum of its proper divisors (91799848252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86483438468 is a wasteful number, since it uses less digits than its factorization.
86483438468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12025 (or 12016 counting only the distinct ones).
The product of its digits is 84934656, while the sum is 62.
The spelling of 86483438468 in words is "eighty-six billion, four hundred eighty-three million, four hundred thirty-eight thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •