Base | Representation |
---|---|
bin | 110001110111011000… |
… | …0001000011000101001 |
3 | 101020101220221222011112 |
4 | 1203232300020120221 |
5 | 3223302202403034 |
6 | 121105531040105 |
7 | 10510442602400 |
oct | 1435660103051 |
9 | 336356858145 |
10 | 107084809769 |
11 | 41461646593 |
12 | 189065a0035 |
13 | a13756b082 |
14 | 527bd76637 |
15 | 2bbb2077ce |
hex | 18eec08629 |
107084809769 has 12 divisors (see below), whose sum is σ = 131895577044. Its totient is φ = 86387745024.
The previous prime is 107084809757. The next prime is 107084809801. The reversal of 107084809769 is 967908480701.
It can be written as a sum of positive squares in 2 ways, for example, as 47347584025 + 59737225744 = 217595^2 + 244412^2 .
It is not a de Polignac number, because 107084809769 - 224 = 107068032553 is a prime.
It is a super-2 number, since 2×1070848097692 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (59) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (107084809709) 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, 64275764 + ... + 64277429.
It is an arithmetic number, because the mean of its divisors is an integer number (10991298087).
Almost surely, 2107084809769 is an apocalyptic number.
It is an amenable number.
107084809769 is a deficient number, since it is larger than the sum of its proper divisors (24810767275).
107084809769 is a wasteful number, since it uses less digits than its factorization.
107084809769 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128553224 (or 128553217 counting only the distinct ones).
The product of its (nonzero) digits is 6096384, while the sum is 59.
The spelling of 107084809769 in words is "one hundred seven billion, eighty-four million, eight hundred nine thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •