Base | Representation |
---|---|
bin | 1010011111011… |
… | …10111011100100 |
3 | 20010121101122222 |
4 | 11033232323210 |
5 | 140012313333 |
6 | 12422211512 |
7 | 2116035200 |
oct | 517567344 |
9 | 203541588 |
10 | 88010468 |
11 | 45752627 |
12 | 25583b98 |
13 | 15306500 |
14 | b98db00 |
15 | 7ad7298 |
hex | 53eeee4 |
88010468 has 54 divisors (see below), whose sum is σ = 194079186. Its totient is φ = 34804224.
The previous prime is 88010467. The next prime is 88010497. The reversal of 88010468 is 86401088.
It can be written as a sum of positive squares in 3 ways, for example, as 550564 + 87459904 = 742^2 + 9352^2 .
It is not an unprimeable number, because it can be changed into a prime (88010467) 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 17 ways as a sum of consecutive naturals, for example, 31796 + ... + 34452.
It is an arithmetic number, because the mean of its divisors is an integer number (3594059).
Almost surely, 288010468 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 88010468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97039593).
88010468 is an abundant number, since it is smaller than the sum of its proper divisors (106068718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
88010468 is a wasteful number, since it uses less digits than its factorization.
88010468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2701 (or 2679 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 35.
The square root of 88010468 is about 9381.3894493300. The cubic root of 88010468 is about 444.8136542506.
The spelling of 88010468 in words is "eighty-eight million, ten thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •