Base | Representation |
---|---|
bin | 10000010110000101001… |
… | …100011101111010000101 |
3 | 10222101020012122222112110 |
4 | 100112011030131322011 |
5 | 121400324100232323 |
6 | 2220000050211233 |
7 | 144102315561000 |
oct | 20260514357205 |
9 | 3871205588473 |
10 | 1123221102213 |
11 | 3a33a0036861 |
12 | 161830583b19 |
13 | 81bc48cc742 |
14 | 3c5154ac537 |
15 | 1e33e3d7793 |
hex | 1058531de85 |
1123221102213 has 32 divisors (see below), whose sum is σ = 1747345305600. Its totient is φ = 641531861040.
The previous prime is 1123221102203. The next prime is 1123221102217. The reversal of 1123221102213 is 3122011223211.
It is not a de Polignac number, because 1123221102213 - 224 = 1123204324997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1123221102213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123221102217) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1886008 + ... + 2409038.
It is an arithmetic number, because the mean of its divisors is an integer number (54604540800).
Almost surely, 21123221102213 is an apocalyptic number.
It is an amenable number.
1123221102213 is a deficient number, since it is larger than the sum of its proper divisors (624124203387).
1123221102213 is an equidigital number, since it uses as much as digits as its factorization.
1123221102213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 525142 (or 525128 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1123221102213 its reverse (3122011223211), we get a palindrome (4245232325424).
The spelling of 1123221102213 in words is "one trillion, one hundred twenty-three billion, two hundred twenty-one million, one hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •