Base | Representation |
---|---|
bin | 110101000100000110… |
… | …0101100101111001001 |
3 | 101220010122220010122201 |
4 | 1222020030230233021 |
5 | 3331334232230131 |
6 | 124203321320201 |
7 | 11142614356102 |
oct | 1521014545711 |
9 | 356118803581 |
10 | 113954180041 |
11 | 443671890a9 |
12 | 1a103036061 |
13 | a990797a00 |
14 | 573040b3a9 |
15 | 2e6e31b761 |
hex | 1a8832cbc9 |
113954180041 has 27 divisors (see below), whose sum is σ = 129106749429. Its totient is φ = 100525943232.
The previous prime is 113954180027. The next prime is 113954180101. The reversal of 113954180041 is 140081459311.
The square root of 113954180041 is 337571.
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 67727460025 + 46226720016 = 260245^2 + 215004^2 .
It is not a de Polignac number, because 113954180041 - 211 = 113954177993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113954180741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 100933165 + ... + 100934293.
Almost surely, 2113954180041 is an apocalyptic number.
113954180041 is the 337571-st square number.
113954180041 is the 168786-th centered octagonal number.
It is an amenable number.
113954180041 is a deficient number, since it is larger than the sum of its proper divisors (15152569388).
113954180041 is an frugal number, since it uses more digits than its factorization.
113954180041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2330 (or 1165 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 37.
The spelling of 113954180041 in words is "one hundred thirteen billion, nine hundred fifty-four million, one hundred eighty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •