Base | Representation |
---|---|
bin | 10000000010100000001… |
… | …111010111010100100111 |
3 | 10220100222012202212010110 |
4 | 100002200033113110213 |
5 | 121024301200310043 |
6 | 2202202123224103 |
7 | 142426354334640 |
oct | 20024017272447 |
9 | 3810865685113 |
10 | 1102200010023 |
11 | 3954931980a2 |
12 | 159744678033 |
13 | 7cc24811358 |
14 | 3b4bd7486c7 |
15 | 1da0dbc0b33 |
hex | 100a03d7527 |
1102200010023 has 32 divisors (see below), whose sum is σ = 1733982400512. Its totient is φ = 609419865600.
The previous prime is 1102200010001. The next prime is 1102200010027. The reversal of 1102200010023 is 3200100022011.
It is not a de Polignac number, because 1102200010023 - 25 = 1102200009991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102200009990 and 1102200010008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102200010027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4324393 + ... + 4572173.
It is an arithmetic number, because the mean of its divisors is an integer number (54186950016).
Almost surely, 21102200010023 is an apocalyptic number.
1102200010023 is a deficient number, since it is larger than the sum of its proper divisors (631782390489).
1102200010023 is a wasteful number, since it uses less digits than its factorization.
1102200010023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254655.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1102200010023 its reverse (3200100022011), we get a palindrome (4302300032034).
The spelling of 1102200010023 in words is "one trillion, one hundred two billion, two hundred million, ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •