Base | Representation |
---|---|
bin | 10000010101010110010… |
… | …010010110001100011100 |
3 | 10222022012100210212010011 |
4 | 100111112102112030130 |
5 | 121342221113124312 |
6 | 2215350014253004 |
7 | 144043651360456 |
oct | 20252622261434 |
9 | 3868170725104 |
10 | 1122434114332 |
11 | 3a3026883153 |
12 | 161650ab7164 |
13 | 81aca85443b |
14 | 3c47cb6d2d6 |
15 | 1e2e5280da7 |
hex | 1055649631c |
1122434114332 has 12 divisors (see below), whose sum is σ = 1971350892280. Its totient is φ = 559191002256.
The previous prime is 1122434114323. The next prime is 1122434114341. The reversal of 1122434114332 is 2334114342211.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1122434114323) and next prime (1122434114341).
It is a super-2 number, since 2×11224341143322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1122434114294 and 1122434114303.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 506512482 + ... + 506514697.
Almost surely, 21122434114332 is an apocalyptic number.
It is an amenable number.
1122434114332 is a deficient number, since it is larger than the sum of its proper divisors (848916777948).
1122434114332 is a wasteful number, since it uses less digits than its factorization.
1122434114332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013027460 (or 1013027458 counting only the distinct ones).
The product of its digits is 13824, while the sum is 31.
Adding to 1122434114332 its reverse (2334114342211), we get a palindrome (3456548456543).
The spelling of 1122434114332 in words is "one trillion, one hundred twenty-two billion, four hundred thirty-four million, one hundred fourteen thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •