Base | Representation |
---|---|
bin | 1011111000000011000001… |
… | …0110110100000011100000 |
3 | 1201020021201110020001122112 |
4 | 2332000300112310003200 |
5 | 3202413241014212332 |
6 | 43434312123254452 |
7 | 2515242213403004 |
oct | 276006026640340 |
9 | 51207643201575 |
10 | 13057511866592 |
11 | 4184729049356 |
12 | 156a77237a428 |
13 | 739419aac4cb |
14 | 331db6276704 |
15 | 1799c8754db2 |
hex | be0305b40e0 |
13057511866592 has 24 divisors (see below), whose sum is σ = 25730539321032. Its totient is φ = 6522771721600.
The previous prime is 13057511866591. The next prime is 13057511866601. The reversal of 13057511866592 is 29566811575031.
It is a super-2 number, since 2×130575118665922 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13057511866591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 186971159 + ... + 187040982.
It is an arithmetic number, because the mean of its divisors is an integer number (1072105805043).
Almost surely, 213057511866592 is an apocalyptic number.
It is an amenable number.
13057511866592 is a deficient number, since it is larger than the sum of its proper divisors (12673027454440).
13057511866592 is a wasteful number, since it uses less digits than its factorization.
13057511866592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374013242 (or 374013234 counting only the distinct ones).
The product of its (nonzero) digits is 13608000, while the sum is 59.
The spelling of 13057511866592 in words is "thirteen trillion, fifty-seven billion, five hundred eleven million, eight hundred sixty-six thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •