Base | Representation |
---|---|
bin | 11110100111101100010… |
… | …11001110000011010001 |
3 | 10201120122210211012200221 |
4 | 33103312023032003101 |
5 | 114214201123001442 |
6 | 2123155024313041 |
7 | 136004033526640 |
oct | 17236613160321 |
9 | 3646583735627 |
10 | 1052102156497 |
11 | 37621526a267 |
12 | 14baa2a72781 |
13 | 7829c6ccb42 |
14 | 38cca025357 |
15 | 1c57a94c467 |
hex | f4f62ce0d1 |
1052102156497 has 16 divisors (see below), whose sum is σ = 1210171801600. Its totient is φ = 895975898688.
The previous prime is 1052102156461. The next prime is 1052102156507. The reversal of 1052102156497 is 7946512012501.
It is a cyclic number.
It is not a de Polignac number, because 1052102156497 - 211 = 1052102154449 is a prime.
It is a super-2 number, since 2×10521021564972 (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 (1052102156407) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14028703 + ... + 14103499.
It is an arithmetic number, because the mean of its divisors is an integer number (75635737600).
Almost surely, 21052102156497 is an apocalyptic number.
It is an amenable number.
1052102156497 is a deficient number, since it is larger than the sum of its proper divisors (158069645103).
1052102156497 is a wasteful number, since it uses less digits than its factorization.
1052102156497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87760.
The product of its (nonzero) digits is 151200, while the sum is 43.
Adding to 1052102156497 its reverse (7946512012501), we get a palindrome (8998614168998).
The spelling of 1052102156497 in words is "one trillion, fifty-two billion, one hundred two million, one hundred fifty-six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •