Base | Representation |
---|---|
bin | 11001110010011100001100… |
… | …001110100000111011100001 |
3 | 112212120121011001211002220101 |
4 | 121302130030032200323201 |
5 | 104331212322032020321 |
6 | 1041115123125342401 |
7 | 32614065030602551 |
oct | 3162341416407341 |
9 | 485517131732811 |
10 | 113417406516961 |
11 | 33158063214078 |
12 | 10879077b67a01 |
13 | 4b392a5716771 |
14 | 2001608a99161 |
15 | d1a3a8a76791 |
hex | 67270c3a0ee1 |
113417406516961 has 4 divisors (see below), whose sum is σ = 117328351569300. Its totient is φ = 109506461464624.
The previous prime is 113417406516959. The next prime is 113417406516977. The reversal of 113417406516961 is 169615604714311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 65395832859361 + 48021573657600 = 8086769^2 + 6929760^2 .
It is a cyclic number.
It is not a de Polignac number, because 113417406516961 - 21 = 113417406516959 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113417406511961) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1955472526126 + ... + 1955472526183.
It is an arithmetic number, because the mean of its divisors is an integer number (29332087892325).
Almost surely, 2113417406516961 is an apocalyptic number.
It is an amenable number.
113417406516961 is a deficient number, since it is larger than the sum of its proper divisors (3910945052339).
113417406516961 is an equidigital number, since it uses as much as digits as its factorization.
113417406516961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3910945052338.
The product of its (nonzero) digits is 3265920, while the sum is 55.
The spelling of 113417406516961 in words is "one hundred thirteen trillion, four hundred seventeen billion, four hundred six million, five hundred sixteen thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •