Base | Representation |
---|---|
bin | 11110100111110001011… |
… | …11100010110011110101 |
3 | 10201120202210212201202012 |
4 | 33103320233202303311 |
5 | 114214243134430031 |
6 | 2123203203454005 |
7 | 136005065630552 |
oct | 17237057426365 |
9 | 3646683781665 |
10 | 1052145233141 |
11 | 3762376113a2 |
12 | 14bab5387305 |
13 | 782a8602b92 |
14 | 38cd1a39a29 |
15 | 1c57e60ab2b |
hex | f4f8be2cf5 |
1052145233141 has 8 divisors (see below), whose sum is σ = 1089162142464. Its totient is φ = 1015320620160.
The previous prime is 1052145233107. The next prime is 1052145233143. The reversal of 1052145233141 is 1413325412501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1052145233141 - 218 = 1052144970997 is a prime.
It is a super-2 number, since 2×10521452331412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1052145233098 and 1052145233107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1052145233143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48062951 + ... + 48084836.
It is an arithmetic number, because the mean of its divisors is an integer number (136145267808).
Almost surely, 21052145233141 is an apocalyptic number.
It is an amenable number.
1052145233141 is a deficient number, since it is larger than the sum of its proper divisors (37016909323).
1052145233141 is an equidigital number, since it uses as much as digits as its factorization.
1052145233141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96148171.
The product of its (nonzero) digits is 14400, while the sum is 32.
The spelling of 1052145233141 in words is "one trillion, fifty-two billion, one hundred forty-five million, two hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •