Base | Representation |
---|---|
bin | 110100110011100111… |
… | …1110010001011001101 |
3 | 101211201010121222112122 |
4 | 1221213033302023031 |
5 | 3324221220344441 |
6 | 124032412142325 |
7 | 11123122330262 |
oct | 1514717621315 |
9 | 354633558478 |
10 | 113401340621 |
11 | 44103111718 |
12 | 19b89a679a5 |
13 | a9030a1caa |
14 | 56bac1d269 |
15 | 2e3aa1734b |
hex | 1a673f22cd |
113401340621 has 8 divisors (see below), whose sum is σ = 113685751800. Its totient is φ = 113117275648.
The previous prime is 113401340599. The next prime is 113401340677. The reversal of 113401340621 is 126043104311.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 93853386025 + 19547954596 = 306355^2 + 139814^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113401340621 - 26 = 113401340557 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113401340821) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 575705 + ... + 747153.
It is an arithmetic number, because the mean of its divisors is an integer number (14210718975).
Almost surely, 2113401340621 is an apocalyptic number.
It is an amenable number.
113401340621 is a deficient number, since it is larger than the sum of its proper divisors (284411179).
113401340621 is an equidigital number, since it uses as much as digits as its factorization.
113401340621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173103.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 113401340621 its reverse (126043104311), we get a palindrome (239444444932).
The spelling of 113401340621 in words is "one hundred thirteen billion, four hundred one million, three hundred forty thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •