Base | Representation |
---|---|
bin | 110100110000101000… |
… | …1001001000000101001 |
3 | 101211110010212211100121 |
4 | 1221201101021000221 |
5 | 3324020031024001 |
6 | 124014430203241 |
7 | 11120463614242 |
oct | 1514121110051 |
9 | 354403784317 |
10 | 113301033001 |
11 | 44061530062 |
12 | 19b60353521 |
13 | a8b8381480 |
14 | 56ab78bcc9 |
15 | 2e31d016a1 |
hex | 1a61449029 |
113301033001 has 4 divisors (see below), whose sum is σ = 122016497092. Its totient is φ = 104585568912.
The previous prime is 113301032993. The next prime is 113301033031. The reversal of 113301033001 is 100330103311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4668168976 + 108632864025 = 68324^2 + 329595^2 .
It is a cyclic number.
It is not a de Polignac number, because 113301033001 - 23 = 113301032993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113301033031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4357732026 + ... + 4357732051.
It is an arithmetic number, because the mean of its divisors is an integer number (30504124273).
Almost surely, 2113301033001 is an apocalyptic number.
It is an amenable number.
113301033001 is a deficient number, since it is larger than the sum of its proper divisors (8715464091).
113301033001 is an equidigital number, since it uses as much as digits as its factorization.
113301033001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8715464090.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 113301033001 its reverse (100330103311), we get a palindrome (213631136312).
The spelling of 113301033001 in words is "one hundred thirteen billion, three hundred one million, thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •