Base | Representation |
---|---|
bin | 10000010101000010011… |
… | …011100111111110001011 |
3 | 10222021100011000000001221 |
4 | 100111002123213332023 |
5 | 121341030324031443 |
6 | 2215252554422511 |
7 | 144032465101033 |
oct | 20250233477613 |
9 | 3867304000057 |
10 | 1122101002123 |
11 | 3a2975843002 |
12 | 161579431a37 |
13 | 81a76831c1a |
14 | 3c44a81a8c3 |
15 | 1e2c5dd0eed |
hex | 105426e7f8b |
1122101002123 has 4 divisors (see below), whose sum is σ = 1122190761168. Its totient is φ = 1122011243080.
The previous prime is 1122101002039. The next prime is 1122101002159. The reversal of 1122101002123 is 3212001012211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1122101002123 - 217 = 1122100871051 is a prime.
It is a super-2 number, since 2×11221010021232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1122101002097 and 1122101002106.
It is not an unprimeable number, because it can be changed into a prime (1122101003123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44860768 + ... + 44885773.
It is an arithmetic number, because the mean of its divisors is an integer number (280547690292).
Almost surely, 21122101002123 is an apocalyptic number.
1122101002123 is a deficient number, since it is larger than the sum of its proper divisors (89759045).
1122101002123 is an equidigital number, since it uses as much as digits as its factorization.
1122101002123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89759044.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1122101002123 its reverse (3212001012211), we get a palindrome (4334102014334).
The spelling of 1122101002123 in words is "one trillion, one hundred twenty-two billion, one hundred one million, two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •