Base | Representation |
---|---|
bin | 10000010011000110011… |
… | …101111110000010110001 |
3 | 10222001222012120020120110 |
4 | 100103012131332002301 |
5 | 121322300414221113 |
6 | 2214310342131533 |
7 | 143630112322401 |
oct | 20230635760261 |
9 | 3861865506513 |
10 | 1120021242033 |
11 | 3a1aa8879511 |
12 | 161098a20ba9 |
13 | 818049ac755 |
14 | 3c2d051c801 |
15 | 1e203515bc3 |
hex | 104c677e0b1 |
1120021242033 has 4 divisors (see below), whose sum is σ = 1493361656048. Its totient is φ = 746680828020.
The previous prime is 1120021241971. The next prime is 1120021242049. The reversal of 1120021242033 is 3302421200211.
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 1120021242033 - 226 = 1119954133169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120021242073) 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, 186670207003 + ... + 186670207008.
It is an arithmetic number, because the mean of its divisors is an integer number (373340414012).
Almost surely, 21120021242033 is an apocalyptic number.
It is an amenable number.
1120021242033 is a deficient number, since it is larger than the sum of its proper divisors (373340414015).
1120021242033 is an equidigital number, since it uses as much as digits as its factorization.
1120021242033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373340414014.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1120021242033 its reverse (3302421200211), we get a palindrome (4422442442244).
The spelling of 1120021242033 in words is "one trillion, one hundred twenty billion, twenty-one million, two hundred forty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •