Base | Representation |
---|---|
bin | 11101110000000010001… |
… | …00001110100111010101 |
3 | 10121201112021110120021112 |
4 | 32320001010032213111 |
5 | 113222001321231401 |
6 | 2101333524224405 |
7 | 133565365334552 |
oct | 16700104164725 |
9 | 3551467416245 |
10 | 1022220102101 |
11 | 364580664540 |
12 | 14614353b105 |
13 | 755198c2853 |
14 | 3769351da29 |
15 | 1b8cc3703bb |
hex | ee0110e9d5 |
1022220102101 has 16 divisors (see below), whose sum is σ = 1119551932800. Its totient is φ = 925623652800.
The previous prime is 1022220102091. The next prime is 1022220102121. The reversal of 1022220102101 is 1012010222201.
It is a de Polignac number, because none of the positive numbers 2k-1022220102101 is a prime.
It is a super-2 number, since 2×10222201021012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022220102121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13636160 + ... + 13710918.
It is an arithmetic number, because the mean of its divisors is an integer number (69971995800).
Almost surely, 21022220102101 is an apocalyptic number.
1022220102101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1022220102101 is a deficient number, since it is larger than the sum of its proper divisors (97331830699).
1022220102101 is a wasteful number, since it uses less digits than its factorization.
1022220102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79660.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1022220102101 its reverse (1012010222201), we get a palindrome (2034230324302).
The spelling of 1022220102101 in words is "one trillion, twenty-two billion, two hundred twenty million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •