Base | Representation |
---|---|
bin | 10000010011000110011… |
… | …101000011001100111110 |
3 | 10222001222012002222222010 |
4 | 100103012131003030332 |
5 | 121322300334013042 |
6 | 2214310333032050 |
7 | 143630110266630 |
oct | 20230635031476 |
9 | 3861865088863 |
10 | 1120021001022 |
11 | 3a1aa8724430 |
12 | 161098925626 |
13 | 81804926b41 |
14 | 3c2d0498a50 |
15 | 1e2034b959c |
hex | 104c674333e |
1120021001022 has 64 divisors (see below), whose sum is σ = 2939768064000. Its totient is φ = 275603251680.
The previous prime is 1120021001009. The next prime is 1120021001039. The reversal of 1120021001022 is 2201001200211.
It is a junction number, because it is equal to n+sod(n) for n = 1120021000989 and 1120021001007.
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 in 31 ways as a sum of consecutive naturals, for example, 63788272 + ... + 63805827.
It is an arithmetic number, because the mean of its divisors is an integer number (45933876000).
Almost surely, 21120021001022 is an apocalyptic number.
1120021001022 is an abundant number, since it is smaller than the sum of its proper divisors (1819747062978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120021001022 is a wasteful number, since it uses less digits than its factorization.
1120021001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127594141.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1120021001022 its reverse (2201001200211), we get a palindrome (3321022201233).
The spelling of 1120021001022 in words is "one trillion, one hundred twenty billion, twenty-one million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •