Base | Representation |
---|---|
bin | 110100111101010000… |
… | …1011110111001100001 |
3 | 101212112200011202012001 |
4 | 1221322201132321201 |
5 | 3330402013403421 |
6 | 124124444004001 |
7 | 11134130255131 |
oct | 1517241367141 |
9 | 355480152161 |
10 | 113724747361 |
11 | 44259722a15 |
12 | 1a05a230601 |
13 | a9550a6a24 |
14 | 570bb66ac1 |
15 | 2e590eb691 |
hex | 1a7a85ee61 |
113724747361 has 9 divisors (see below), whose sum is σ = 120032050131. Its totient is φ = 107733164184.
The previous prime is 113724747343. The next prime is 113724747371. The reversal of 113724747361 is 163747427311.
The square root of 113724747361 is 337231.
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., 6677994961 + 107046752400 = 81719^2 + 327180^2 .
It is not a de Polignac number, because 113724747361 - 27 = 113724747233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113724747341) 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, 6398515 + ... + 6416263.
It is an arithmetic number, because the mean of its divisors is an integer number (13336894459).
Almost surely, 2113724747361 is an apocalyptic number.
113724747361 is the 337231-st square number.
113724747361 is the 168616-th centered octagonal number.
It is an amenable number.
113724747361 is a deficient number, since it is larger than the sum of its proper divisors (6307302770).
113724747361 is an frugal number, since it uses more digits than its factorization.
113724747361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35536 (or 17768 counting only the distinct ones).
The product of its digits is 592704, while the sum is 46.
The spelling of 113724747361 in words is "one hundred thirteen billion, seven hundred twenty-four million, seven hundred forty-seven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •