Base | Representation |
---|---|
bin | 10000010011001011001… |
… | …011001101011000101110 |
3 | 10222002011201011020120012 |
4 | 100103023023031120232 |
5 | 121322431123211342 |
6 | 2214322242453222 |
7 | 143632061460350 |
oct | 20231313153056 |
9 | 3862151136505 |
10 | 1120100210222 |
11 | 3a2039405484 |
12 | 1610bb364212 |
13 | 8181816b2a6 |
14 | 3c2dabd70d0 |
15 | 1e20a413b82 |
hex | 104cb2cd62e |
1120100210222 has 16 divisors (see below), whose sum is σ = 1929272134272. Its totient is φ = 477767860920.
The previous prime is 1120100210219. The next prime is 1120100210227. The reversal of 1120100210222 is 2220120010211.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 1120100210197 and 1120100210206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120100210227) 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 7 ways as a sum of consecutive naturals, for example, 189587468 + ... + 189593375.
It is an arithmetic number, because the mean of its divisors is an integer number (120579508392).
Almost surely, 21120100210222 is an apocalyptic number.
1120100210222 is a deficient number, since it is larger than the sum of its proper divisors (809171924050).
1120100210222 is a wasteful number, since it uses less digits than its factorization.
1120100210222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379181063.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1120100210222 its reverse (2220120010211), we get a palindrome (3340220220433).
The spelling of 1120100210222 in words is "one trillion, one hundred twenty billion, one hundred million, two hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •