Base | Representation |
---|---|
bin | 100110111100111… |
… | …1101011010110001 |
3 | 10101002102111000000 |
4 | 1031321331122301 |
5 | 10134100230114 |
6 | 333410220213 |
7 | 44250436344 |
oct | 11571753261 |
9 | 3332374000 |
10 | 1307039409 |
11 | 610876065 |
12 | 305884669 |
13 | 17aa31100 |
14 | c583445b |
15 | 79b30e09 |
hex | 4de7d6b1 |
1307039409 has 63 divisors (see below), whose sum is σ = 2142803547. Its totient is φ = 796522896.
The previous prime is 1307039399. The next prime is 1307039443. The reversal of 1307039409 is 9049307031.
The square root of 1307039409 is 36153.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 193349025 + 1113690384 = 13905^2 + 33372^2 .
It is not a de Polignac number, because 1307039409 - 27 = 1307039281 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1307039609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 62 ways as a sum of consecutive naturals, for example, 12689652 + ... + 12689754.
Almost surely, 21307039409 is an apocalyptic number.
1307039409 is the 36153-rd square number.
1307039409 is the 18077-th centered octagonal number.
It is an amenable number.
1307039409 is a deficient number, since it is larger than the sum of its proper divisors (835764138).
1307039409 is an frugal number, since it uses more digits than its factorization.
1307039409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250 (or 119 counting only the distinct ones).
The product of its (nonzero) digits is 20412, while the sum is 36.
The cubic root of 1307039409 is about 1093.3592767139.
Multiplying 1307039409 by its sum of digits (36), we get a square (47053418724 = 2169182).
The spelling of 1307039409 in words is "one billion, three hundred seven million, thirty-nine thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •