Base | Representation |
---|---|
bin | 10011010010000011111… |
… | …011100000000100001101 |
3 | 11200200012221110001121011 |
4 | 103102003323200010031 |
5 | 133202212203342201 |
6 | 2452420430005221 |
7 | 164506206361351 |
oct | 23220373400415 |
9 | 4620187401534 |
10 | 1325063340301 |
11 | 470a57790778 |
12 | 194981046811 |
13 | 97c507aa10c |
14 | 481c20dd461 |
15 | 2470445a151 |
hex | 13483ee010d |
1325063340301 has 8 divisors (see below), whose sum is σ = 1346841895808. Its totient is φ = 1303286598000.
The previous prime is 1325063340299. The next prime is 1325063340319. The reversal of 1325063340301 is 1030433605231.
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 1325063340301 - 21 = 1325063340299 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 (1325063344301) 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, 1061536 + ... + 1943446.
It is an arithmetic number, because the mean of its divisors is an integer number (168355236976).
Almost surely, 21325063340301 is an apocalyptic number.
It is an amenable number.
1325063340301 is a deficient number, since it is larger than the sum of its proper divisors (21778555507).
1325063340301 is an equidigital number, since it uses as much as digits as its factorization.
1325063340301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 906603.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 1325063340301 its reverse (1030433605231), we get a palindrome (2355496945532).
The spelling of 1325063340301 in words is "one trillion, three hundred twenty-five billion, sixty-three million, three hundred forty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •