Base | Representation |
---|---|
bin | 11101101111110101000… |
… | …00101011100001000000 |
3 | 10121201020121111220012101 |
4 | 32313322200223201000 |
5 | 113221240142320000 |
6 | 2101314555040144 |
7 | 133562561446204 |
oct | 16677240534100 |
9 | 3551217456171 |
10 | 1022110120000 |
11 | 364524575342 |
12 | 146112740054 |
13 | 754ccb95698 |
14 | 37682a90b04 |
15 | 1b8c2897e6a |
hex | edfa82b840 |
1022110120000 has 70 divisors (see below), whose sum is σ = 2534501010998. Its totient is φ = 408844032000.
The previous prime is 1022110119881. The next prime is 1022110120081. The reversal of 1022110120000 is 210112201.
It can be written as a sum of positive squares in 5 ways, for example, as 487550269504 + 534559850496 = 698248^2 + 731136^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
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 9 ways as a sum of consecutive naturals, for example, 12736377 + ... + 12816376.
Almost surely, 21022110120000 is an apocalyptic number.
1022110120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022110120000 is an abundant number, since it is smaller than the sum of its proper divisors (1512390890998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022110120000 is an frugal number, since it uses more digits than its factorization.
1022110120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25552785 (or 25552760 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1022110120000 its reverse (210112201), we get a palindrome (1022320232201).
The spelling of 1022110120000 in words is "one trillion, twenty-two billion, one hundred ten million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •