Base | Representation |
---|---|
bin | 110010111011101000… |
… | …0101110110001000001 |
3 | 101110022112110120200121 |
4 | 1211313100232301001 |
5 | 3243000003310321 |
6 | 122125103020241 |
7 | 10621262434042 |
oct | 1456720566101 |
9 | 343275416617 |
10 | 109375056961 |
11 | 42427406165 |
12 | 1924559a681 |
13 | a410baa021 |
14 | 54181c68c9 |
15 | 2ca22ee441 |
hex | 197742ec41 |
109375056961 has 3 divisors (see below), whose sum is σ = 109375387681. Its totient is φ = 109374726242.
The previous prime is 109375056941. The next prime is 109375056991. The reversal of 109375056961 is 169650573901.
The square root of 109375056961 is 330719.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 109375056961 - 29 = 109375056449 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 109375056899 and 109375056908.
It is not an unprimeable number, because it can be changed into a prime (109375056941) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 165360 + ... + 496078.
Almost surely, 2109375056961 is an apocalyptic number.
109375056961 is the 330719-th square number.
109375056961 is the 165360-th centered octagonal number.
It is an amenable number.
109375056961 is a deficient number, since it is larger than the sum of its proper divisors (330720).
109375056961 is an frugal number, since it uses more digits than its factorization.
109375056961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 661438 (or 330719 counting only the distinct ones).
The product of its (nonzero) digits is 1530900, while the sum is 52.
The spelling of 109375056961 in words is "one hundred nine billion, three hundred seventy-five million, fifty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •