Base | Representation |
---|---|
bin | 110101010111111… |
… | …110101000000000 |
3 | 2022102000000020221 |
4 | 311113332220000 |
5 | 3313220301042 |
6 | 224505112424 |
7 | 31122303553 |
oct | 6527765000 |
9 | 2272000227 |
10 | 895478272 |
11 | 41a524097 |
12 | 20ba88714 |
13 | 1136a2500 |
14 | 86d0069a |
15 | 53936d67 |
hex | 355fea00 |
895478272 has 120 divisors (see below), whose sum is σ = 1976927040. Its totient is φ = 404951040.
The previous prime is 895478267. The next prime is 895478299. The reversal of 895478272 is 272874598.
It is a happy number.
895478272 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6835647 + ... + 6835777.
It is an arithmetic number, because the mean of its divisors is an integer number (16474392).
Almost surely, 2895478272 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 895478272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (988463520).
895478272 is an abundant number, since it is smaller than the sum of its proper divisors (1081448768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
895478272 is a wasteful number, since it uses less digits than its factorization.
895478272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254 (or 225 counting only the distinct ones).
The product of its digits is 2257920, while the sum is 52.
The square root of 895478272 is about 29924.5429706119. The cubic root of 895478272 is about 963.8697504848.
The spelling of 895478272 in words is "eight hundred ninety-five million, four hundred seventy-eight thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •