Base | Representation |
---|---|
bin | 1011010111111… |
… | …01001010000000 |
3 | 20122112021020002 |
4 | 11223331022000 |
5 | 143411040033 |
6 | 13244535132 |
7 | 2235650450 |
oct | 553751200 |
9 | 218467202 |
10 | 95408768 |
11 | 49946024 |
12 | 27b514a8 |
13 | 169c6ac0 |
14 | c957d60 |
15 | 85993e8 |
hex | 5afd280 |
95408768 has 64 divisors (see below), whose sum is σ = 233963520. Its totient is φ = 37739520.
The previous prime is 95408717. The next prime is 95408791. The reversal of 95408768 is 86780459.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×954087682 = 18205666022555648, which contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 7553 + ... + 15743.
It is an arithmetic number, because the mean of its divisors is an integer number (3655680).
Almost surely, 295408768 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 95408768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116981760).
95408768 is an abundant number, since it is smaller than the sum of its proper divisors (138554752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
95408768 is a wasteful number, since it uses less digits than its factorization.
95408768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8225 (or 8213 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 47.
The square root of 95408768 is about 9767.7411923126. The cubic root of 95408768 is about 456.9437722400.
The spelling of 95408768 in words is "ninety-five million, four hundred eight thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •