Base | Representation |
---|---|
bin | 10000010100000000111… |
… | …011101100010011011111 |
3 | 10222011111120020121112000 |
4 | 100110000323230103133 |
5 | 121331303020042343 |
6 | 2214551541413343 |
7 | 143663322510300 |
oct | 20240073542337 |
9 | 3864446217460 |
10 | 1121002112223 |
11 | 3a2461516834 |
12 | 16131140a253 |
13 | 8192cc7c606 |
14 | 3c3848ca7a7 |
15 | 1e25e6b8ed3 |
hex | 10500eec4df |
1121002112223 has 48 divisors (see below), whose sum is σ = 2045526104160. Its totient is φ = 602891880192.
The previous prime is 1121002112213. The next prime is 1121002112231. The reversal of 1121002112223 is 3222112001211.
It is not a de Polignac number, because 1121002112223 - 26 = 1121002112159 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1121002112196 and 1121002112205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121002112213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24898636 + ... + 24943617.
It is an arithmetic number, because the mean of its divisors is an integer number (42615127170).
Almost surely, 21121002112223 is an apocalyptic number.
1121002112223 is a deficient number, since it is larger than the sum of its proper divisors (924523991937).
1121002112223 is a wasteful number, since it uses less digits than its factorization.
1121002112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49842293 (or 49842280 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1121002112223 its reverse (3222112001211), we get a palindrome (4343114113434).
The spelling of 1121002112223 in words is "one trillion, one hundred twenty-one billion, two million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •