Base | Representation |
---|---|
bin | 100010110101… |
… | …001011010011 |
3 | 122011212222100 |
4 | 202311023103 |
5 | 4314140312 |
6 | 523411443 |
7 | 140416065 |
oct | 42651323 |
9 | 18155870 |
10 | 9130707 |
11 | 5177043 |
12 | 3083b83 |
13 | 1b78cb1 |
14 | 12d9735 |
15 | c055dc |
hex | 8b52d3 |
9130707 has 12 divisors (see below), whose sum is σ = 13326040. Its totient is φ = 6023808.
The previous prime is 9130691. The next prime is 9130729. The reversal of 9130707 is 7070319.
9130707 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 9130707 - 24 = 9130691 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9130757) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4357 + ... + 6102.
Almost surely, 29130707 is an apocalyptic number.
9130707 is a gapful number since it is divisible by the number (97) formed by its first and last digit.
9130707 is a deficient number, since it is larger than the sum of its proper divisors (4195333).
9130707 is a wasteful number, since it uses less digits than its factorization.
9130707 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10562 (or 10559 counting only the distinct ones).
The product of its (nonzero) digits is 1323, while the sum is 27.
The square root of 9130707 is about 3021.7059751074. The cubic root of 9130707 is about 209.0105151032.
The spelling of 9130707 in words is "nine million, one hundred thirty thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •