Base | Representation |
---|---|
bin | 11101101111110110001… |
… | …10110010100000010100 |
3 | 10121201021022022110001002 |
4 | 32313323012302200110 |
5 | 113221300222010400 |
6 | 2101315553122432 |
7 | 133563042404645 |
oct | 16677306624024 |
9 | 3551238273032 |
10 | 1022120110100 |
11 | 36452a179021 |
12 | 146115b59418 |
13 | 75501c8289b |
14 | 376841316cc |
15 | 1b8c36bced5 |
hex | edfb1b2814 |
1022120110100 has 18 divisors (see below), whose sum is σ = 2218000639134. Its totient is φ = 408848044000.
The previous prime is 1022120110027. The next prime is 1022120110177. The reversal of 1022120110100 is 10110212201.
It can be written as a sum of positive squares in 3 ways, for example, as 163484366224 + 858635743876 = 404332^2 + 926626^2 .
It is a super-3 number, since 3×10221201101003 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5110600451 + ... + 5110600650.
Almost surely, 21022120110100 is an apocalyptic number.
1022120110100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022120110100 is an abundant number, since it is smaller than the sum of its proper divisors (1195880529034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022120110100 is a wasteful number, since it uses less digits than its factorization.
1022120110100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10221201115 (or 10221201108 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1022120110100 its reverse (10110212201), we get a palindrome (1032230322301).
The spelling of 1022120110100 in words is "one trillion, twenty-two billion, one hundred twenty million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •