Base | Representation |
---|---|
bin | 10000010011010010011… |
… | …100100100010010111101 |
3 | 10222002111012201000110221 |
4 | 100103102130210102331 |
5 | 121323203340413041 |
6 | 2214342321301341 |
7 | 143635102412560 |
oct | 20232234442275 |
9 | 3862435630427 |
10 | 1120222201021 |
11 | 3a20a1256a20 |
12 | 161134194851 |
13 | 818375113b1 |
14 | 3c30d0b04d7 |
15 | 1e215eae2d1 |
hex | 104d27244bd |
1120222201021 has 32 divisors (see below), whose sum is σ = 1410712289280. Its totient is φ = 864108648000.
The previous prime is 1120222200989. The next prime is 1120222201061. The reversal of 1120222201021 is 1201022220211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1120222201021 - 25 = 1120222200989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120222200986 and 1120222201004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120222201061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 71439460 + ... + 71455138.
It is an arithmetic number, because the mean of its divisors is an integer number (44084759040).
Almost surely, 21120222201021 is an apocalyptic number.
1120222201021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1120222201021 is a deficient number, since it is larger than the sum of its proper divisors (290490088259).
1120222201021 is a wasteful number, since it uses less digits than its factorization.
1120222201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24985.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1120222201021 its reverse (1201022220211), we get a palindrome (2321244421232).
The spelling of 1120222201021 in words is "one trillion, one hundred twenty billion, two hundred twenty-two million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •