Base | Representation |
---|---|
bin | 110100111111010111… |
… | …1101011010001000000 |
3 | 101212201121110021001011 |
4 | 1221332233223101000 |
5 | 3331023131430041 |
6 | 124135454050304 |
7 | 11135650305211 |
oct | 1517657532100 |
9 | 355647407034 |
10 | 113795576896 |
11 | 44295700221 |
12 | 1a079aa9994 |
13 | a966975cb1 |
14 | 5717323408 |
15 | 2e6043ce81 |
hex | 1a7ebeb440 |
113795576896 has 63 divisors (see below), whose sum is σ = 228144949221. Its totient is φ = 56316221184.
The previous prime is 113795576893. The next prime is 113795576899. The reversal of 113795576896 is 698675597311.
The square root of 113795576896 is 337336.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (113795576893) and next prime (113795576899).
It can be written as a sum of positive squares in only one way, i.e., 13331935296 + 100463641600 = 115464^2 + 316960^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113795576893) 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, 402104371 + ... + 402104653.
Almost surely, 2113795576896 is an apocalyptic number.
113795576896 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
113795576896 is the 337336-th square number.
It is an amenable number.
113795576896 is an abundant number, since it is smaller than the sum of its proper divisors (114349372325).
113795576896 is an frugal number, since it uses more digits than its factorization.
113795576896 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 876 (or 434 counting only the distinct ones).
The product of its digits is 85730400, while the sum is 67.
The spelling of 113795576896 in words is "one hundred thirteen billion, seven hundred ninety-five million, five hundred seventy-six thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •