Base | Representation |
---|---|
bin | 11110100100110010011… |
… | …00001010010010010100 |
3 | 10201102122002100020212101 |
4 | 33102121030022102110 |
5 | 114203002240402012 |
6 | 2122340135331444 |
7 | 135620261462536 |
oct | 17223114122224 |
9 | 3642562306771 |
10 | 1050542122132 |
11 | 375594705368 |
12 | 14b728520b84 |
13 | 780b144b099 |
14 | 38bbcb75856 |
15 | 1c4d89e4d57 |
hex | f49930a494 |
1050542122132 has 12 divisors (see below), whose sum is σ = 1857401793940. Its totient is φ = 519855895296.
The previous prime is 1050542122111. The next prime is 1050542122159. The reversal of 1050542122132 is 2312212450501.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 540569034756 + 509973087376 = 735234^2 + 714124^2 .
It is a super-2 number, since 2×10505421221322 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1050542122132.
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, 1353791007 + ... + 1353791782.
Almost surely, 21050542122132 is an apocalyptic number.
It is an amenable number.
1050542122132 is a deficient number, since it is larger than the sum of its proper divisors (806859671808).
1050542122132 is a wasteful number, since it uses less digits than its factorization.
1050542122132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2707582890 (or 2707582888 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 1050542122132 its reverse (2312212450501), we get a palindrome (3362754572633).
The spelling of 1050542122132 in words is "one trillion, fifty billion, five hundred forty-two million, one hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •