Base | Representation |
---|---|
bin | 1100001001001100100010… |
… | …1111010100000111101110 |
3 | 1202021110011122001222221122 |
4 | 3002103020233110013232 |
5 | 3222230123301433400 |
6 | 44221514311100542 |
7 | 2545442064054335 |
oct | 302231057240756 |
9 | 52243148058848 |
10 | 13352126202350 |
11 | 4288672174371 |
12 | 15b7894071752 |
13 | 75b13bbba130 |
14 | 342364004d1c |
15 | 1824bd1cb685 |
hex | c24c8bd41ee |
13352126202350 has 24 divisors (see below), whose sum is σ = 26745335871240. Its totient is φ = 4930015828320.
The previous prime is 13352126202277. The next prime is 13352126202383. The reversal of 13352126202350 is 5320262125331.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13352126202350.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10270865660 + ... + 10270866959.
It is an arithmetic number, because the mean of its divisors is an integer number (1114388994635).
Almost surely, 213352126202350 is an apocalyptic number.
13352126202350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13352126202350 is an abundant number, since it is smaller than the sum of its proper divisors (13393209668890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13352126202350 is a wasteful number, since it uses less digits than its factorization.
13352126202350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20541732644 (or 20541732639 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 13352126202350 its reverse (5320262125331), we get a palindrome (18672388327681).
The spelling of 13352126202350 in words is "thirteen trillion, three hundred fifty-two billion, one hundred twenty-six million, two hundred two thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •