Base | Representation |
---|---|
bin | 110100110001010000… |
… | …1001000011100100101 |
3 | 101211111121100011201002 |
4 | 1221202201020130211 |
5 | 3324040413032323 |
6 | 124020455443045 |
7 | 11121140061050 |
oct | 1514241103445 |
9 | 354447304632 |
10 | 113322002213 |
11 | 44072352592 |
12 | 19b67386485 |
13 | a8bc813aa4 |
14 | 56b0489a97 |
15 | 2e33a94828 |
hex | 1a62848725 |
113322002213 has 4 divisors (see below), whose sum is σ = 129510859680. Its totient is φ = 97133144748.
The previous prime is 113322002197. The next prime is 113322002219. The reversal of 113322002213 is 312200223311.
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 a cyclic number.
It is not a de Polignac number, because 113322002213 - 24 = 113322002197 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 (113322002219) 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, 8094428723 + ... + 8094428736.
It is an arithmetic number, because the mean of its divisors is an integer number (32377714920).
Almost surely, 2113322002213 is an apocalyptic number.
It is an amenable number.
113322002213 is a deficient number, since it is larger than the sum of its proper divisors (16188857467).
113322002213 is an equidigital number, since it uses as much as digits as its factorization.
113322002213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16188857466.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 113322002213 its reverse (312200223311), we get a palindrome (425522225524).
The spelling of 113322002213 in words is "one hundred thirteen billion, three hundred twenty-two million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •