Base | Representation |
---|---|
bin | 110100101110100001… |
… | …0001111111001111101 |
3 | 101211021012021000010122 |
4 | 1221131002033321331 |
5 | 3323343341121341 |
6 | 124003412144325 |
7 | 11115642202013 |
oct | 1513502177175 |
9 | 354235230118 |
10 | 113230020221 |
11 | 4402543810a |
12 | 19b406080a5 |
13 | a8a6749986 |
14 | 56a21848b3 |
15 | 2e2a97594b |
hex | 1a5d08fe7d |
113230020221 has 4 divisors (see below), whose sum is σ = 113822847744. Its totient is φ = 112637192700.
The previous prime is 113230020217. The next prime is 113230020227. The reversal of 113230020221 is 122020032311.
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 113230020221 - 22 = 113230020217 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113230020221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113230020227) 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, 296413475 + ... + 296413856.
It is an arithmetic number, because the mean of its divisors is an integer number (28455711936).
Almost surely, 2113230020221 is an apocalyptic number.
It is an amenable number.
113230020221 is a deficient number, since it is larger than the sum of its proper divisors (592827523).
113230020221 is an equidigital number, since it uses as much as digits as its factorization.
113230020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 592827522.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 113230020221 its reverse (122020032311), we get a palindrome (235250052532).
The spelling of 113230020221 in words is "one hundred thirteen billion, two hundred thirty million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •