Base | Representation |
---|---|
bin | 10001111111111… |
… | …011011001111100 |
3 | 210001012201102122 |
4 | 101333323121330 |
5 | 1104301033233 |
6 | 45544142112 |
7 | 10324466060 |
oct | 2177733174 |
9 | 701181378 |
10 | 301971068 |
11 | 145500373 |
12 | 85167938 |
13 | 4a73b009 |
14 | 2c167aa0 |
15 | 1b79cd98 |
hex | 11ffb67c |
301971068 has 48 divisors (see below), whose sum is σ = 655107264. Its totient is φ = 118824960.
The previous prime is 301971067. The next prime is 301971127. The reversal of 301971068 is 860179103.
301971068 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301971067) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11780 + ... + 27252.
It is an arithmetic number, because the mean of its divisors is an integer number (13648068).
Almost surely, 2301971068 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 301971068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (327553632).
301971068 is an abundant number, since it is smaller than the sum of its proper divisors (353136196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
301971068 is a wasteful number, since it uses less digits than its factorization.
301971068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15542 (or 15540 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 35.
The square root of 301971068 is about 17377.3147522855. The cubic root of 301971068 is about 670.8958596024.
The spelling of 301971068 in words is "three hundred one million, nine hundred seventy-one thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •