Base | Representation |
---|---|
bin | 1100001001001100011100… |
… | …1100111001100010000111 |
3 | 1202021110002211112021100120 |
4 | 3002103013030321202013 |
5 | 3222230100200401320 |
6 | 44221511550113023 |
7 | 2545441331553501 |
oct | 302230714714207 |
9 | 52243084467316 |
10 | 13352100403335 |
11 | 4288659653171 |
12 | 15b78874ab773 |
13 | 75b136756345 |
14 | 34236080ad71 |
15 | 1824bacd2440 |
hex | c24c7339887 |
13352100403335 has 16 divisors (see below), whose sum is σ = 21393836212320. Its totient is φ = 7110961692800.
The previous prime is 13352100403333. The next prime is 13352100403429. The reversal of 13352100403335 is 53330400125331.
It is not a de Polignac number, because 13352100403335 - 21 = 13352100403333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13352100403296 and 13352100403305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13352100403331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 634896780 + ... + 634917809.
It is an arithmetic number, because the mean of its divisors is an integer number (1337114763270).
Almost surely, 213352100403335 is an apocalyptic number.
13352100403335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13352100403335 is a deficient number, since it is larger than the sum of its proper divisors (8041735808985).
13352100403335 is a wasteful number, since it uses less digits than its factorization.
13352100403335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1269815298.
The product of its (nonzero) digits is 48600, while the sum is 33.
Adding to 13352100403335 its reverse (53330400125331), we get a palindrome (66682500528666).
The spelling of 13352100403335 in words is "thirteen trillion, three hundred fifty-two billion, one hundred million, four hundred three thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •