Base | Representation |
---|---|
bin | 1011111100011101101000… |
… | …0000011010011001111100 |
3 | 1201111112112022111211111102 |
4 | 2333013122000122121330 |
5 | 3210134121334040431 |
6 | 43533215453312232 |
7 | 2523566133610166 |
oct | 277073200323174 |
9 | 51445468454442 |
10 | 13133372565116 |
11 | 4203917476a21 |
12 | 1581403a95678 |
13 | 74361949b4bb |
14 | 335931399936 |
15 | 17b968633dcb |
hex | bf1da01a67c |
13133372565116 has 12 divisors (see below), whose sum is σ = 22983495564120. Its totient is φ = 6566659546800.
The previous prime is 13133372565113. The next prime is 13133372565121. The reversal of 13133372565116 is 61156527333131.
It is a hoax number, since the sum of its digits (47) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13133372565113) 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 3 ways as a sum of consecutive naturals, for example, 5557586 + ... + 7559993.
It is an arithmetic number, because the mean of its divisors is an integer number (1915291297010).
Almost surely, 213133372565116 is an apocalyptic number.
It is an amenable number.
13133372565116 is a deficient number, since it is larger than the sum of its proper divisors (9850122999004).
13133372565116 is a wasteful number, since it uses less digits than its factorization.
13133372565116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13367884 (or 13367882 counting only the distinct ones).
The product of its digits is 1020600, while the sum is 47.
Adding to 13133372565116 its reverse (61156527333131), we get a palindrome (74289899898247).
The spelling of 13133372565116 in words is "thirteen trillion, one hundred thirty-three billion, three hundred seventy-two million, five hundred sixty-five thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •