Base | Representation |
---|---|
bin | 110100110000101001… |
… | …0010001110111011101 |
3 | 101211110011102222201012 |
4 | 1221201102101313131 |
5 | 3324020120101141 |
6 | 124014440425005 |
7 | 11120466266255 |
oct | 1514122216735 |
9 | 354404388635 |
10 | 113301331421 |
11 | 44061714293 |
12 | 19b60478165 |
13 | a8b8457255 |
14 | 56ab828965 |
15 | 2e31d5eceb |
hex | 1a61491ddd |
113301331421 has 4 divisors (see below), whose sum is σ = 113303547552. Its totient is φ = 113299115292.
The previous prime is 113301331379. The next prime is 113301331433. The reversal of 113301331421 is 124133103311.
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 113301331421 - 214 = 113301315037 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 (113301331921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1029521 + ... + 1134246.
It is an arithmetic number, because the mean of its divisors is an integer number (28325886888).
Almost surely, 2113301331421 is an apocalyptic number.
It is an amenable number.
113301331421 is a deficient number, since it is larger than the sum of its proper divisors (2216131).
113301331421 is an equidigital number, since it uses as much as digits as its factorization.
113301331421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2216130.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 113301331421 its reverse (124133103311), we get a palindrome (237434434732).
The spelling of 113301331421 in words is "one hundred thirteen billion, three hundred one million, three hundred thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •