Base | Representation |
---|---|
bin | 10010111111111100000… |
… | …100001001011000110001 |
3 | 11121210222210022222121102 |
4 | 102333330010021120301 |
5 | 132342334113124040 |
6 | 2435441453334145 |
7 | 163220041125233 |
oct | 22777404113061 |
9 | 4553883288542 |
10 | 1305604036145 |
11 | 463781494522 |
12 | 191050197355 |
13 | 9616c135a66 |
14 | 47297964253 |
15 | 23e65de5515 |
hex | 12ffc109631 |
1305604036145 has 8 divisors (see below), whose sum is σ = 1567285004904. Its totient is φ = 1044109787904.
The previous prime is 1305604036129. The next prime is 1305604036153. The reversal of 1305604036145 is 5416304065031.
It can be written as a sum of positive squares in 4 ways, for example, as 62466004624 + 1243138031521 = 249932^2 + 1114961^2 .
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 1305604036145 - 24 = 1305604036129 is a prime.
It is a super-2 number, since 2×13056040361452 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1305604036099 and 1305604036108.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46664744 + ... + 46692713.
It is an arithmetic number, because the mean of its divisors is an integer number (195910625613).
Almost surely, 21305604036145 is an apocalyptic number.
It is an amenable number.
1305604036145 is a deficient number, since it is larger than the sum of its proper divisors (261680968759).
1305604036145 is an equidigital number, since it uses as much as digits as its factorization.
1305604036145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93360259.
The product of its (nonzero) digits is 129600, while the sum is 38.
The spelling of 1305604036145 in words is "one trillion, three hundred five billion, six hundred four million, thirty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •