Base | Representation |
---|---|
bin | 110100101011110110… |
… | …0100011010100110010 |
3 | 101211000221201012002221 |
4 | 1221113230203110302 |
5 | 3323202423242024 |
6 | 123550452231254 |
7 | 11113503633124 |
oct | 1512754432462 |
9 | 354027635087 |
10 | 113140446514 |
11 | 43a89918057 |
12 | 19b1660b52a |
13 | a891016a94 |
14 | 5694309214 |
15 | 2e22b803e4 |
hex | 1a57b23532 |
113140446514 has 4 divisors (see below), whose sum is σ = 169710669774. Its totient is φ = 56570223256.
The previous prime is 113140446491. The next prime is 113140446539. The reversal of 113140446514 is 415644041311.
113140446514 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 415644041311 = 23 ⋅18071480057.
It can be written as a sum of positive squares in only one way, i.e., 109696752025 + 3443694489 = 331205^2 + 58683^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 113140446514.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28285111627 + ... + 28285111630.
Almost surely, 2113140446514 is an apocalyptic number.
113140446514 is a deficient number, since it is larger than the sum of its proper divisors (56570223260).
113140446514 is an equidigital number, since it uses as much as digits as its factorization.
113140446514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56570223259.
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 113140446514 its reverse (415644041311), we get a palindrome (528784487825).
The spelling of 113140446514 in words is "one hundred thirteen billion, one hundred forty million, four hundred forty-six thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •