Base | Representation |
---|---|
bin | 10000001100100101001… |
… | …111010110110000100001 |
3 | 10221101220100221221210210 |
4 | 100030211033112300201 |
5 | 121213431423441113 |
6 | 2211152005244333 |
7 | 143261464024251 |
oct | 20144517266041 |
9 | 3841810857723 |
10 | 1113021312033 |
11 | 39a0365724a4 |
12 | 15b8647036a9 |
13 | 80c5a6cc637 |
14 | 3bc289bd961 |
15 | 1de43c126c3 |
hex | 103253d6c21 |
1113021312033 has 4 divisors (see below), whose sum is σ = 1484028416048. Its totient is φ = 742014208020.
The previous prime is 1113021312019. The next prime is 1113021312041. The reversal of 1113021312033 is 3302131203111.
It is a happy number.
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 not a de Polignac number, because 1113021312033 - 25 = 1113021312001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113021312233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 185503552003 + ... + 185503552008.
It is an arithmetic number, because the mean of its divisors is an integer number (371007104012).
Almost surely, 21113021312033 is an apocalyptic number.
It is an amenable number.
1113021312033 is a deficient number, since it is larger than the sum of its proper divisors (371007104015).
1113021312033 is an equidigital number, since it uses as much as digits as its factorization.
1113021312033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 371007104014.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1113021312033 its reverse (3302131203111), we get a palindrome (4415152515144).
The spelling of 1113021312033 in words is "one trillion, one hundred thirteen billion, twenty-one million, three hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •