Base | Representation |
---|---|
bin | 10001110011010100110… |
… | …000001111000010010100 |
3 | 11022221122200021101012202 |
4 | 101303110300033002110 |
5 | 130020400033020411 |
6 | 2333554504304032 |
7 | 154245336334445 |
oct | 21632460170224 |
9 | 4287580241182 |
10 | 1223340126356 |
11 | 4318a7677517 |
12 | 179112172018 |
13 | 8b48bc83b6a |
14 | 432d22732cc |
15 | 21c4dcd383b |
hex | 11cd4c0f094 |
1223340126356 has 6 divisors (see below), whose sum is σ = 2140845221130. Its totient is φ = 611670063176.
The previous prime is 1223340126347. The next prime is 1223340126409. The reversal of 1223340126356 is 6536210433221.
It can be written as a sum of positive squares in only one way, i.e., 661889636356 + 561450490000 = 813566^2 + 749300^2 .
It is a super-2 number, since 2×12233401263562 (a number of 25 digits) contains 22 as substring.
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 as a sum of consecutive naturals, namely, 152917515791 + ... + 152917515798.
It is an arithmetic number, because the mean of its divisors is an integer number (356807536855).
Almost surely, 21223340126356 is an apocalyptic number.
It is an amenable number.
1223340126356 is a deficient number, since it is larger than the sum of its proper divisors (917505094774).
1223340126356 is a wasteful number, since it uses less digits than its factorization.
1223340126356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305835031593 (or 305835031591 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 38.
Adding to 1223340126356 its reverse (6536210433221), we get a palindrome (7759550559577).
The spelling of 1223340126356 in words is "one trillion, two hundred twenty-three billion, three hundred forty million, one hundred twenty-six thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •