Base | Representation |
---|---|
bin | 110010000010100011… |
… | …1100100001100001001 |
3 | 101021101002001020100121 |
4 | 1210011013210030021 |
5 | 3230034233123341 |
6 | 121211053503241 |
7 | 10522650240301 |
oct | 1440507441411 |
9 | 337332036317 |
10 | 107460051721 |
11 | 41634441400 |
12 | 189b01a1b21 |
13 | a197221629 |
14 | 52b5b34601 |
15 | 2bde12a4d1 |
hex | 19051e4309 |
107460051721 has 27 divisors (see below), whose sum is σ = 125545648053. Its totient is φ = 91891979520.
The previous prime is 107460051689. The next prime is 107460051733. The reversal of 107460051721 is 127150064701.
The square root of 107460051721 is 327811.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 10689285321 + 96770766400 = 103389^2 + 311080^2 .
It is not a de Polignac number, because 107460051721 - 25 = 107460051689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107460051821) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 61299781 + ... + 61301533.
Almost surely, 2107460051721 is an apocalyptic number.
107460051721 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
107460051721 is the 327811-st square number.
107460051721 is the 163906-th centered octagonal number.
It is an amenable number.
107460051721 is a deficient number, since it is larger than the sum of its proper divisors (18085596332).
107460051721 is an frugal number, since it uses more digits than its factorization.
107460051721 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3562 (or 1781 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 34.
The spelling of 107460051721 in words is "one hundred seven billion, four hundred sixty million, fifty-one thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •