Base | Representation |
---|---|
bin | 10011101001111001110011… |
… | …011100011111111111100000 |
3 | 102100001211001212120210121221 |
4 | 103221321303130133333200 |
5 | 42312233113323301313 |
6 | 503503040201424424 |
7 | 24131155314113320 |
oct | 2351716334377740 |
9 | 370054055523557 |
10 | 86442448650208 |
11 | 255a8044793092 |
12 | 984116119b114 |
13 | 3930645ca3441 |
14 | 174bba03d9280 |
15 | 9ed876c37c8d |
hex | 4e9e7371ffe0 |
86442448650208 has 48 divisors (see below), whose sum is σ = 194496176748384. Its totient is φ = 37046636605440.
The previous prime is 86442448650109. The next prime is 86442448650209. The reversal of 86442448650208 is 80205684424468.
It is a super-2 number, since 2×864424486502082 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86442448650209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96600616 + ... + 97491352.
It is an arithmetic number, because the mean of its divisors is an integer number (4052003682258).
Almost surely, 286442448650208 is an apocalyptic number.
It is an amenable number.
86442448650208 is an abundant number, since it is smaller than the sum of its proper divisors (108053728098176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86442448650208 is a wasteful number, since it uses less digits than its factorization.
86442448650208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1323995 (or 1323987 counting only the distinct ones).
The product of its (nonzero) digits is 94371840, while the sum is 61.
The spelling of 86442448650208 in words is "eighty-six trillion, four hundred forty-two billion, four hundred forty-eight million, six hundred fifty thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •