Base | Representation |
---|---|
bin | 10010010011100… |
… | …010110100110110 |
3 | 210101212222012120 |
4 | 102103202310312 |
5 | 1112110111040 |
6 | 50250300410 |
7 | 10416263652 |
oct | 2223426466 |
9 | 711788176 |
10 | 307113270 |
11 | 1483a2822 |
12 | 86a27706 |
13 | 4b81b739 |
14 | 2cb05a62 |
15 | 1be667d0 |
hex | 124e2d36 |
307113270 has 32 divisors (see below), whose sum is σ = 750982752. Its totient is φ = 80351232.
The previous prime is 307113241. The next prime is 307113299. The reversal of 307113270 is 72311703.
It is an interprime number because it is at equal distance from previous prime (307113241) and next prime (307113299).
It is a super-2 number, since 2×3071132702 = 188637121220185800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 307113270.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94987 + ... + 98166.
It is an arithmetic number, because the mean of its divisors is an integer number (23468211).
Almost surely, 2307113270 is an apocalyptic number.
307113270 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
307113270 is an abundant number, since it is smaller than the sum of its proper divisors (443869482).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
307113270 is a wasteful number, since it uses less digits than its factorization.
307113270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193216.
The product of its (nonzero) digits is 882, while the sum is 24.
The square root of 307113270 is about 17524.6475000212. The cubic root of 307113270 is about 674.6826272065.
Adding to 307113270 its reverse (72311703), we get a palindrome (379424973).
The spelling of 307113270 in words is "three hundred seven million, one hundred thirteen thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •