Base | Representation |
---|---|
bin | 11110100111110010000… |
… | …10001111100101001001 |
3 | 10201120210011002202222201 |
4 | 33103321002033211021 |
5 | 114214300413310423 |
6 | 2123203500520201 |
7 | 136005155405200 |
oct | 17237102174511 |
9 | 3646704082881 |
10 | 1052150135113 |
11 | 37623a35a310 |
12 | 14bab6b50061 |
13 | 782a962b15c |
14 | 38cd2554237 |
15 | 1c57ec782ad |
hex | f4f908f949 |
1052150135113 has 12 divisors (see below), whose sum is σ = 1335196090512. Its totient is φ = 819857247720.
The previous prime is 1052150135063. The next prime is 1052150135117. The reversal of 1052150135113 is 3115310512501.
It is not a de Polignac number, because 1052150135113 - 29 = 1052150134601 is a prime.
It is a super-2 number, since 2×10521501351132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1052150135117) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 976019995 + ... + 976021072.
It is an arithmetic number, because the mean of its divisors is an integer number (111266340876).
Almost surely, 21052150135113 is an apocalyptic number.
It is an amenable number.
1052150135113 is a deficient number, since it is larger than the sum of its proper divisors (283045955399).
1052150135113 is a wasteful number, since it uses less digits than its factorization.
1052150135113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1952041092 (or 1952041085 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 28.
Adding to 1052150135113 its reverse (3115310512501), we get a palindrome (4167460647614).
The spelling of 1052150135113 in words is "one trillion, fifty-two billion, one hundred fifty million, one hundred thirty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •