Base | Representation |
---|---|
bin | 1100001001011001001101… |
… | …0010111011001101101110 |
3 | 1202021202221110122012011102 |
4 | 3002112103102323031232 |
5 | 3222304103240111100 |
6 | 44223235425123102 |
7 | 2545622230316210 |
oct | 302262322731556 |
9 | 52252843565142 |
10 | 13355524535150 |
11 | 428a056471076 |
12 | 15b8482189492 |
13 | 75b560c7b145 |
14 | 3425a749a5b0 |
15 | 18261b704cd5 |
hex | c25934bb36e |
13355524535150 has 96 divisors (see below), whose sum is σ = 28687786364160. Its totient is φ = 4531028382720.
The previous prime is 13355524535081. The next prime is 13355524535191. The reversal of 13355524535150 is 5153542555331.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13355524535095 and 13355524535104.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 210560141 + ... + 210623559.
It is an arithmetic number, because the mean of its divisors is an integer number (298831107960).
Almost surely, 213355524535150 is an apocalyptic number.
13355524535150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13355524535150 is an abundant number, since it is smaller than the sum of its proper divisors (15332261829010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13355524535150 is a wasteful number, since it uses less digits than its factorization.
13355524535150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69738 (or 69733 counting only the distinct ones).
The product of its (nonzero) digits is 3375000, while the sum is 47.
The spelling of 13355524535150 in words is "thirteen trillion, three hundred fifty-five billion, five hundred twenty-four million, five hundred thirty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •