Base | Representation |
---|---|
bin | 1100001001001110000010… |
… | …0001110000001000010011 |
3 | 1202021111012110001021100002 |
4 | 3002103200201300020103 |
5 | 3222231432434101433 |
6 | 44222022045120215 |
7 | 2545455011251133 |
oct | 302234041601023 |
9 | 52244173037302 |
10 | 13352525300243 |
11 | 4288857483538 |
12 | 15b798585906b |
13 | 75b1a37a3c2c |
14 | 3423a1012ac3 |
15 | 1824e32629e8 |
hex | c24e0870213 |
13352525300243 has 4 divisors (see below), whose sum is σ = 13352553718200. Its totient is φ = 13352496882288.
The previous prime is 13352525300227. The next prime is 13352525300263. The reversal of 13352525300243 is 34200352525331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13352525300243 - 24 = 13352525300227 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13352525300197 and 13352525300206.
It is not an unprimeable number, because it can be changed into a prime (13352525300263) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13492130 + ... + 14447927.
It is an arithmetic number, because the mean of its divisors is an integer number (3338138429550).
Almost surely, 213352525300243 is an apocalyptic number.
13352525300243 is a deficient number, since it is larger than the sum of its proper divisors (28417957).
13352525300243 is an equidigital number, since it uses as much as digits as its factorization.
13352525300243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28417956.
The product of its (nonzero) digits is 324000, while the sum is 38.
Adding to 13352525300243 its reverse (34200352525331), we get a palindrome (47552877825574).
The spelling of 13352525300243 in words is "thirteen trillion, three hundred fifty-two billion, five hundred twenty-five million, three hundred thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •