Base | Representation |
---|---|
bin | 110100101011110101… |
… | …1101010101000011101 |
3 | 101211000221021101120110 |
4 | 1221113223222220131 |
5 | 3323202343324201 |
6 | 123550443240233 |
7 | 11113501645122 |
oct | 1512753525035 |
9 | 354027241513 |
10 | 113140214301 |
11 | 43a89779644 |
12 | 19b16519079 |
13 | a890c6518a |
14 | 5694288749 |
15 | 2e22b366d6 |
hex | 1a57aeaa1d |
113140214301 has 4 divisors (see below), whose sum is σ = 150853619072. Its totient is φ = 75426809532.
The previous prime is 113140214287. The next prime is 113140214339. The reversal of 113140214301 is 103412041311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 113140214301 - 26 = 113140214237 is a prime.
It is a super-3 number, since 3×1131402143013 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113140214351) 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, 18856702381 + ... + 18856702386.
It is an arithmetic number, because the mean of its divisors is an integer number (37713404768).
Almost surely, 2113140214301 is an apocalyptic number.
It is an amenable number.
113140214301 is a deficient number, since it is larger than the sum of its proper divisors (37713404771).
113140214301 is an equidigital number, since it uses as much as digits as its factorization.
113140214301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37713404770.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 113140214301 its reverse (103412041311), we get a palindrome (216552255612).
The spelling of 113140214301 in words is "one hundred thirteen billion, one hundred forty million, two hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •