Base | Representation |
---|---|
bin | 1011010110011… |
… | …11000100000000 |
3 | 20122011200020111 |
4 | 11223033010000 |
5 | 143334014333 |
6 | 13240521104 |
7 | 2234233144 |
oct | 553170400 |
9 | 218150214 |
10 | 95219968 |
11 | 49827198 |
12 | 27a80194 |
13 | 1695bb9c |
14 | c909224 |
15 | 855d4cd |
hex | 5acf100 |
95219968 has 36 divisors (see below), whose sum is σ = 190729728. Its totient is φ = 47444480.
The previous prime is 95219933. The next prime is 95219989. The reversal of 95219968 is 86991259.
It is a super-3 number, since 3×952199683 (a number of 25 digits) contains 333 as substring.
Its product of digits (349920) is a multiple of the sum of its prime divisors (1296).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 109905 + ... + 110767.
It is an arithmetic number, because the mean of its divisors is an integer number (5298048).
Almost surely, 295219968 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 95219968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95364864).
95219968 is an abundant number, since it is smaller than the sum of its proper divisors (95509760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
95219968 is an equidigital number, since it uses as much as digits as its factorization.
95219968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1310 (or 1296 counting only the distinct ones).
The product of its digits is 349920, while the sum is 49.
The square root of 95219968 is about 9758.0719407063. The cubic root of 95219968 is about 456.6421649051.
The spelling of 95219968 in words is "ninety-five million, two hundred nineteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •