Base | Representation |
---|---|
bin | 10000010101000010011… |
… | …100000101010001001010 |
3 | 10222021100011020002200100 |
4 | 100111002130011101022 |
5 | 121341030341401442 |
6 | 2215253001150230 |
7 | 144032466110631 |
oct | 20250234052112 |
9 | 3867304202610 |
10 | 1122101122122 |
11 | 3a2975915182 |
12 | 16157948b376 |
13 | 81a76874726 |
14 | 3c44a84c518 |
15 | 1e2c5e0684c |
hex | 1054270544a |
1122101122122 has 48 divisors (see below), whose sum is σ = 2434601142792. Its totient is φ = 373513620480.
The previous prime is 1122101122097. The next prime is 1122101122141. The reversal of 1122101122122 is 2212211012211.
It can be written as a sum of positive squares in 4 ways, for example, as 603109113201 + 518992008921 = 776601^2 + 720411^2 .
It is a super-2 number, since 2×11221011221222 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1122101122095 and 1122101122104.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 90653998 + ... + 90666374.
Almost surely, 21122101122122 is an apocalyptic number.
1122101122122 is an abundant number, since it is smaller than the sum of its proper divisors (1312500020670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122101122122 is a wasteful number, since it uses less digits than its factorization.
1122101122122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18983 (or 18980 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 1122101122122 its reverse (2212211012211), we get a palindrome (3334312134333).
The spelling of 1122101122122 in words is "one trillion, one hundred twenty-two billion, one hundred one million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.847 sec. • engine limits •