Base | Representation |
---|---|
bin | 10011010010001001001… |
… | …011000110000100101101 |
3 | 11200200110001222121010111 |
4 | 103102021023012010231 |
5 | 133202402214023341 |
6 | 2452433251340021 |
7 | 164511325215160 |
oct | 23221113060455 |
9 | 4620401877114 |
10 | 1325151314221 |
11 | 470aa2408899 |
12 | 1949a65b1611 |
13 | 97c65a9caa7 |
14 | 481cda7dad7 |
15 | 2470c036681 |
hex | 134892c612d |
1325151314221 has 8 divisors (see below), whose sum is σ = 1514500905024. Its totient is φ = 1135812288480.
The previous prime is 1325151314143. The next prime is 1325151314231. The reversal of 1325151314221 is 1224131515231.
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 1325151314221 - 221 = 1325149217069 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 (1325151314231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2370640 + ... + 2875801.
It is an arithmetic number, because the mean of its divisors is an integer number (189312613128).
Almost surely, 21325151314221 is an apocalyptic number.
It is an amenable number.
1325151314221 is a deficient number, since it is larger than the sum of its proper divisors (189349590803).
1325151314221 is an equidigital number, since it uses as much as digits as its factorization.
1325151314221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5282531.
The product of its digits is 7200, while the sum is 31.
Adding to 1325151314221 its reverse (1224131515231), we get a palindrome (2549282829452).
The spelling of 1325151314221 in words is "one trillion, three hundred twenty-five billion, one hundred fifty-one million, three hundred fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •