Base | Representation |
---|---|
bin | 110010000010011001… |
… | …1100011101100011001 |
3 | 101021100201011202200121 |
4 | 1210010303203230121 |
5 | 3230031412304214 |
6 | 121210345233241 |
7 | 10522554534100 |
oct | 1440463435431 |
9 | 337321152617 |
10 | 107454806809 |
11 | 41631489869 |
12 | 189aa492821 |
13 | a19610622c |
14 | 52b516b037 |
15 | 2bdd941424 |
hex | 1904ce3b19 |
107454806809 has 9 divisors (see below), whose sum is σ = 125001118047. Its totient is φ = 92102153304.
The previous prime is 107454806777. The next prime is 107454806839. The reversal of 107454806809 is 908608454701.
The square root of 107454806809 is 327803.
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., 8317987209 + 99136819600 = 91203^2 + 314860^2 .
It is not a de Polignac number, because 107454806809 - 25 = 107454806777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107454806839) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2271207 + ... + 2318035.
Almost surely, 2107454806809 is an apocalyptic number.
107454806809 is the 327803-rd square number.
107454806809 is the 163902-nd centered octagonal number.
It is an amenable number.
107454806809 is a deficient number, since it is larger than the sum of its proper divisors (17546311238).
107454806809 is an frugal number, since it uses more digits than its factorization.
107454806809 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93672 (or 46836 counting only the distinct ones).
The product of its (nonzero) digits is 1935360, while the sum is 52.
The spelling of 107454806809 in words is "one hundred seven billion, four hundred fifty-four million, eight hundred six thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •