Base | Representation |
---|---|
bin | 101111010111111011… |
… | …1101000010100100001 |
3 | 100201121002001112101101 |
4 | 1132233313220110201 |
5 | 3131323104444211 |
6 | 114423014434401 |
7 | 10231040621542 |
oct | 1365767502441 |
9 | 321532045341 |
10 | 101734843681 |
11 | 3a166737909 |
12 | 17872962a01 |
13 | 9794068873 |
14 | 4cd16164c9 |
15 | 29a66c25c1 |
hex | 17afde8521 |
101734843681 has 9 divisors (see below), whose sum is σ = 105132694323. Its totient is φ = 98443505760.
The previous prime is 101734843631. The next prime is 101734843729. The reversal of 101734843681 is 186348437101.
The square root of 101734843681 is 318959.
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., 90625683681 + 11109160000 = 301041^2 + 105400^2 .
It is not a de Polignac number, because 101734843681 - 29 = 101734843169 is a prime.
It is a super-2 number, since 2×1017348436812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101734843631) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 9882585 + ... + 9892873.
Almost surely, 2101734843681 is an apocalyptic number.
101734843681 is the 318959-th square number.
101734843681 is the 159480-th centered octagonal number.
It is an amenable number.
101734843681 is a deficient number, since it is larger than the sum of its proper divisors (3397850642).
101734843681 is an frugal number, since it uses more digits than its factorization.
101734843681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20640 (or 10320 counting only the distinct ones).
The product of its (nonzero) digits is 387072, while the sum is 46.
The spelling of 101734843681 in words is "one hundred one billion, seven hundred thirty-four million, eight hundred forty-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •