Base | Representation |
---|---|
bin | 1100010011101100001001… |
… | …0011100101000001110100 |
3 | 1202220200111201000001201120 |
4 | 3010323002103211001310 |
5 | 3233203332131112313 |
6 | 44440411340023540 |
7 | 2564453441500452 |
oct | 304730223450164 |
9 | 52820451001646 |
10 | 13532406894708 |
11 | 43480749a28a9 |
12 | 1626807831bb0 |
13 | 77213ca2c220 |
14 | 34ad871c99d2 |
15 | 18702037cd23 |
hex | c4ec24e5074 |
13532406894708 has 96 divisors (see below), whose sum is σ = 36050117053440. Its totient is φ = 3920595333120.
The previous prime is 13532406894707. The next prime is 13532406894817. The reversal of 13532406894708 is 80749860423531.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13532406894707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37635453 + ... + 37993316.
It is an arithmetic number, because the mean of its divisors is an integer number (375522052640).
It is a 1-persistent number, because it is pandigital, but 2⋅13532406894708 = 27064813789416 is not.
Almost surely, 213532406894708 is an apocalyptic number.
It is an amenable number.
13532406894708 is an abundant number, since it is smaller than the sum of its proper divisors (22517710158732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13532406894708 is a wasteful number, since it uses less digits than its factorization.
13532406894708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75628857 (or 75628855 counting only the distinct ones).
The product of its (nonzero) digits is 34836480, while the sum is 60.
The spelling of 13532406894708 in words is "thirteen trillion, five hundred thirty-two billion, four hundred six million, eight hundred ninety-four thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •