Base | Representation |
---|---|
bin | 10010111101111001010… |
… | …111100111100010100001 |
3 | 11121121022222100201111211 |
4 | 102331321113213202201 |
5 | 132323341244400324 |
6 | 2434440124110121 |
7 | 163111514314516 |
oct | 22757127474241 |
9 | 4547288321454 |
10 | 1303411325089 |
11 | 462856793225 |
12 | 190739995341 |
13 | 95baca86cb3 |
14 | 4712a66330d |
15 | 23d88668294 |
hex | 12f795e78a1 |
1303411325089 has 4 divisors (see below), whose sum is σ = 1380082579524. Its totient is φ = 1226740070656.
The previous prime is 1303411325087. The next prime is 1303411325101. The reversal of 1303411325089 is 9805231143031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 699620163489 + 603791161600 = 836433^2 + 777040^2 .
It is a cyclic number.
It is not a de Polignac number, because 1303411325089 - 21 = 1303411325087 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1303411325081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38335627192 + ... + 38335627225.
It is an arithmetic number, because the mean of its divisors is an integer number (345020644881).
Almost surely, 21303411325089 is an apocalyptic number.
It is an amenable number.
1303411325089 is a deficient number, since it is larger than the sum of its proper divisors (76671254435).
1303411325089 is an equidigital number, since it uses as much as digits as its factorization.
1303411325089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76671254434.
The product of its (nonzero) digits is 77760, while the sum is 40.
The spelling of 1303411325089 in words is "one trillion, three hundred three billion, four hundred eleven million, three hundred twenty-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •