Base | Representation |
---|---|
bin | 10011010010001111001… |
… | …000010100110011010101 |
3 | 11200200201001000221011222 |
4 | 103102033020110303111 |
5 | 133203103310021123 |
6 | 2452451221340125 |
7 | 164513650526225 |
oct | 23221710246325 |
9 | 4620631027158 |
10 | 1325251251413 |
11 | 471043867111 |
12 | 194a13b67645 |
13 | 97c806c0b1b |
14 | 481dd056085 |
15 | 24715bc76c8 |
hex | 1348f214cd5 |
1325251251413 has 8 divisors (see below), whose sum is σ = 1325858183520. Its totient is φ = 1324644436080.
The previous prime is 1325251251383. The next prime is 1325251251427. The reversal of 1325251251413 is 3141521525231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1325251251413 - 214 = 1325251235029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1325251251113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28939931 + ... + 28985687.
It is an arithmetic number, because the mean of its divisors is an integer number (165732272940).
Almost surely, 21325251251413 is an apocalyptic number.
It is an amenable number.
1325251251413 is a deficient number, since it is larger than the sum of its proper divisors (606932107).
1325251251413 is an equidigital number, since it uses as much as digits as its factorization.
1325251251413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58387.
The product of its digits is 36000, while the sum is 35.
Adding to 1325251251413 its reverse (3141521525231), we get a palindrome (4466772776644).
The spelling of 1325251251413 in words is "one trillion, three hundred twenty-five billion, two hundred fifty-one million, two hundred fifty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •