Base | Representation |
---|---|
bin | 110100110001000001… |
… | …0101100001101000101 |
3 | 101211111001022202012112 |
4 | 1221202002230031011 |
5 | 3324031342202323 |
6 | 124020012430405 |
7 | 11121012203540 |
oct | 1514202541505 |
9 | 354431282175 |
10 | 113314022213 |
11 | 440688a2047 |
12 | 19b64778405 |
13 | a8bac7b7b2 |
14 | 56ad3ad857 |
15 | 2e3301a178 |
hex | 1a620ac345 |
113314022213 has 4 divisors (see below), whose sum is σ = 129501739680. Its totient is φ = 97126304748.
The previous prime is 113314022201. The next prime is 113314022249. The reversal of 113314022213 is 312220413311.
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, and also an emirpimes, since its reverse is a distinct semiprime: 312220413311 = 1847 ⋅169041913.
It is a cyclic number.
It is not a de Polignac number, because 113314022213 - 214 = 113314005829 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 (113314022293) 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, 8093858723 + ... + 8093858736.
It is an arithmetic number, because the mean of its divisors is an integer number (32375434920).
Almost surely, 2113314022213 is an apocalyptic number.
It is an amenable number.
113314022213 is a deficient number, since it is larger than the sum of its proper divisors (16187717467).
113314022213 is an equidigital number, since it uses as much as digits as its factorization.
113314022213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16187717466.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 113314022213 its reverse (312220413311), we get a palindrome (425534435524).
The spelling of 113314022213 in words is "one hundred thirteen billion, three hundred fourteen million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •