Base | Representation |
---|---|
bin | 10000010011010111000… |
… | …101011011000100110110 |
3 | 10222002200122010122002011 |
4 | 100103113011123010312 |
5 | 121323333301120042 |
6 | 2214354141234434 |
7 | 143640036023251 |
oct | 20232705330466 |
9 | 3862618118064 |
10 | 1120300020022 |
11 | 3a2131178547 |
12 | 161156262a1a |
13 | 8184a689b41 |
14 | 3c31956a098 |
15 | 1e21cc31a17 |
hex | 104d715b136 |
1120300020022 has 4 divisors (see below), whose sum is σ = 1680450030036. Its totient is φ = 560150010010.
The previous prime is 1120300019989. The next prime is 1120300020067. The reversal of 1120300020022 is 2200200030211.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×11203000200222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1120300019984 and 1120300020011.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 280075005004 + ... + 280075005007.
It is an arithmetic number, because the mean of its divisors is an integer number (420112507509).
Almost surely, 21120300020022 is an apocalyptic number.
1120300020022 is a deficient number, since it is larger than the sum of its proper divisors (560150010014).
1120300020022 is an equidigital number, since it uses as much as digits as its factorization.
1120300020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560150010013.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 1120300020022 its reverse (2200200030211), we get a palindrome (3320500050233).
The spelling of 1120300020022 in words is "one trillion, one hundred twenty billion, three hundred million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •