Base | Representation |
---|---|
bin | 110101111011101101… |
… | …1110110111100010000 |
3 | 102001221201120012102111 |
4 | 1223313123312330100 |
5 | 3344200012044401 |
6 | 125112425355104 |
7 | 11240065240324 |
oct | 1536733667420 |
9 | 361851505374 |
10 | 115820424976 |
11 | 45134679593 |
12 | 1a544038a94 |
13 | abca310359 |
14 | 586a209984 |
15 | 302d0ace51 |
hex | 1af76f6f10 |
115820424976 has 15 divisors (see below), whose sum is σ = 224404710933. Its totient is φ = 57909531840.
The previous prime is 115820424949. The next prime is 115820424989. The reversal of 115820424976 is 679424028511.
The square root of 115820424976 is 340324.
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., 113652591376 + 2167833600 = 337124^2 + 46560^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 1318756 + ... + 1403836.
Almost surely, 2115820424976 is an apocalyptic number.
115820424976 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
115820424976 is the 340324-th square number.
It is an amenable number.
115820424976 is a deficient number, since it is larger than the sum of its proper divisors (108584285957).
115820424976 is an frugal number, since it uses more digits than its factorization.
115820424976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170170 (or 85083 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 49.
Multiplying 115820424976 by its sum of digits (49), we get a square (5675200823824 = 23822682).
The spelling of 115820424976 in words is "one hundred fifteen billion, eight hundred twenty million, four hundred twenty-four thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •