Base | Representation |
---|---|
bin | 10010100110001… |
… | …111001110100000 |
3 | 210202002221101000 |
4 | 102212033032200 |
5 | 1114333414403 |
6 | 50543312000 |
7 | 10506034005 |
oct | 2246171640 |
9 | 722087330 |
10 | 312013728 |
11 | 15013a594 |
12 | 885ab600 |
13 | 4c846110 |
14 | 2d61d8ac |
15 | 1c5d37a3 |
hex | 1298f3a0 |
312013728 has 96 divisors (see below), whose sum is σ = 980078400. Its totient is φ = 96000768.
The previous prime is 312013693. The next prime is 312013747. The reversal of 312013728 is 827310213.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (27).
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 15 ways as a sum of consecutive naturals, for example, 2658 + ... + 25121.
It is an arithmetic number, because the mean of its divisors is an integer number (10209150).
Almost surely, 2312013728 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 312013728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (490039200).
312013728 is an abundant number, since it is smaller than the sum of its proper divisors (668064672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
312013728 is a wasteful number, since it uses less digits than its factorization.
312013728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27811 (or 27797 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 312013728 is about 17663.9103258593. The cubic root of 312013728 is about 678.2522360105.
The spelling of 312013728 in words is "three hundred twelve million, thirteen thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •