Base | Representation |
---|---|
bin | 10010010011001… |
… | …001101101000000 |
3 | 210101200202001101 |
4 | 102103021231000 |
5 | 1112043312433 |
6 | 50244144144 |
7 | 10415354650 |
oct | 2223115500 |
9 | 711622041 |
10 | 307010368 |
11 | 148332485 |
12 | 86998054 |
13 | 4b7b3952 |
14 | 2caba360 |
15 | 1be4607d |
hex | 124c9b40 |
307010368 has 56 divisors (see below), whose sum is σ = 712492352. Its totient is φ = 128507904.
The previous prime is 307010359. The next prime is 307010369. The reversal of 307010368 is 863010703.
It is a tau number, because it is divible by the number of its divisors (56).
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (307010369) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 11296 + ... + 27232.
Almost surely, 2307010368 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 307010368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (356246176).
307010368 is an abundant number, since it is smaller than the sum of its proper divisors (405481984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
307010368 is a wasteful number, since it uses less digits than its factorization.
307010368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15999 (or 15989 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 307010368 is about 17521.7113319447. The cubic root of 307010368 is about 674.6072652755.
The spelling of 307010368 in words is "three hundred seven million, ten thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •