Base | Representation |
---|---|
bin | 10010010100101… |
… | …000110101000000 |
3 | 210102102112112012 |
4 | 102110220311000 |
5 | 1112143300000 |
6 | 50300352052 |
7 | 10421566625 |
oct | 2224506500 |
9 | 712375465 |
10 | 307400000 |
11 | 148579196 |
12 | 86b45628 |
13 | 4b8bc0bb |
14 | 2cb7c34c |
15 | 1bec1735 |
hex | 12528d40 |
307400000 has 168 divisors, whose sum is σ = 803620440. Its totient is φ = 116480000.
The previous prime is 307399973. The next prime is 307400003. The reversal of 307400000 is 4703.
It can be written as a sum of positive squares in 12 ways, for example, as 299151616 + 8248384 = 17296^2 + 2872^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (307400003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5799974 + ... + 5800026.
It is an arithmetic number, because the mean of its divisors is an integer number (4783455).
Almost surely, 2307400000 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 307400000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (401810220).
307400000 is an abundant number, since it is smaller than the sum of its proper divisors (496220440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
307400000 is an frugal number, since it uses more digits than its factorization.
307400000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119 (or 89 counting only the distinct ones).
The product of its (nonzero) digits is 84, while the sum is 14.
The square root of 307400000 is about 17532.8263551545. The cubic root of 307400000 is about 674.8925297579.
Adding to 307400000 its reverse (4703), we get a palindrome (307404703).
The spelling of 307400000 in words is "three hundred seven million, four hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •