Base | Representation |
---|---|
bin | 11110110010000001111… |
… | …11010110111010001101 |
3 | 10202002222121101222212221 |
4 | 33121000333112322031 |
5 | 114312032442234144 |
6 | 2125513451255341 |
7 | 136261416156340 |
oct | 17310077267215 |
9 | 3662877358787 |
10 | 1057652305549 |
11 | 378603176404 |
12 | 150b9174a551 |
13 | 789755219c8 |
14 | 392951b4457 |
15 | 1c7a2d25d84 |
hex | f640fd6e8d |
1057652305549 has 16 divisors (see below), whose sum is σ = 1219931891200. Its totient is φ = 898170643584.
The previous prime is 1057652305547. The next prime is 1057652305571. The reversal of 1057652305549 is 9455032567501.
It is a cyclic number.
It is not a de Polignac number, because 1057652305549 - 21 = 1057652305547 is a prime.
It is a super-2 number, since 2×10576523055492 (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 = 1057652305496 and 1057652305505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1057652305543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10999609 + ... + 11095345.
It is an arithmetic number, because the mean of its divisors is an integer number (76245743200).
Almost surely, 21057652305549 is an apocalyptic number.
It is an amenable number.
1057652305549 is a deficient number, since it is larger than the sum of its proper divisors (162279585651).
1057652305549 is a wasteful number, since it uses less digits than its factorization.
1057652305549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110332.
The product of its (nonzero) digits is 5670000, while the sum is 52.
The spelling of 1057652305549 in words is "one trillion, fifty-seven billion, six hundred fifty-two million, three hundred five thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •