Base | Representation |
---|---|
bin | 10000010100000001011… |
… | …110000100010000010110 |
3 | 10222011112012012102021201 |
4 | 100110001132010100112 |
5 | 121331312321420342 |
6 | 2214552502503114 |
7 | 143663462220364 |
oct | 20240136042026 |
9 | 3864465172251 |
10 | 1121011123222 |
11 | 3a2466610941 |
12 | 161314434a9a |
13 | 81931ab5c73 |
14 | 3c385b94634 |
15 | 1e260398db7 |
hex | 10501784416 |
1121011123222 has 32 divisors (see below), whose sum is σ = 1726738560000. Its totient is φ = 545665788096.
The previous prime is 1121011123207. The next prime is 1121011123229. The reversal of 1121011123222 is 2223211101211.
It is a super-3 number, since 3×11210111232223 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1121011123222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121011123229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4937229 + ... + 5159287.
It is an arithmetic number, because the mean of its divisors is an integer number (53960580000).
Almost surely, 21121011123222 is an apocalyptic number.
1121011123222 is a deficient number, since it is larger than the sum of its proper divisors (605727436778).
1121011123222 is a wasteful number, since it uses less digits than its factorization.
1121011123222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222588.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 1121011123222 its reverse (2223211101211), we get a palindrome (3344222224433).
The spelling of 1121011123222 in words is "one trillion, one hundred twenty-one billion, eleven million, one hundred twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •