Base | Representation |
---|---|
bin | 11110100111101110110… |
… | …00000111000110101000 |
3 | 10201120201012202021101211 |
4 | 33103313120013012220 |
5 | 114214221303010003 |
6 | 2123201024322504 |
7 | 136004400050425 |
oct | 17236730070650 |
9 | 3646635667354 |
10 | 1052122313128 |
11 | 376225687237 |
12 | 14baa9773434 |
13 | 782a3939643 |
14 | 38ccc990d4c |
15 | 1c57c5ce96d |
hex | f4f76071a8 |
1052122313128 has 8 divisors (see below), whose sum is σ = 1972729337130. Its totient is φ = 526061156560.
The previous prime is 1052122313087. The next prime is 1052122313129. The reversal of 1052122313128 is 8213132212501.
It can be written as a sum of positive squares in only one way, i.e., 1028516448964 + 23605864164 = 1014158^2 + 153642^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×10521223131282 (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 1052122313128.
It is not an unprimeable number, because it can be changed into a prime (1052122313129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65757644563 + ... + 65757644578.
Almost surely, 21052122313128 is an apocalyptic number.
It is an amenable number.
1052122313128 is a deficient number, since it is larger than the sum of its proper divisors (920607024002).
1052122313128 is a wasteful number, since it uses less digits than its factorization.
1052122313128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131515289147 (or 131515289143 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 31.
Adding to 1052122313128 its reverse (8213132212501), we get a palindrome (9265254525629).
The spelling of 1052122313128 in words is "one trillion, fifty-two billion, one hundred twenty-two million, three hundred thirteen thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •