Base | Representation |
---|---|
bin | 101000000111000… |
… | …1110001111000001 |
3 | 10110210120002101121 |
4 | 1100032032033001 |
5 | 10224022434401 |
6 | 341315232241 |
7 | 45232003015 |
oct | 12016161701 |
9 | 3423502347 |
10 | 1345905601 |
11 | 630801887 |
12 | 3168a8681 |
13 | 185abb861 |
14 | caa70545 |
15 | 7d25bca1 |
hex | 5038e3c1 |
1345905601 has 4 divisors (see below), whose sum is σ = 1346490304. Its totient is φ = 1345320900.
The previous prime is 1345905577. The next prime is 1345905619. The reversal of 1345905601 is 1065095431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1345905601 - 25 = 1345905569 is a prime.
It is a super-2 number, since 2×13459056012 = 3622923773606342402, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1345905661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 288885 + ... + 293506.
It is an arithmetic number, because the mean of its divisors is an integer number (336622576).
Almost surely, 21345905601 is an apocalyptic number.
It is an amenable number.
1345905601 is a deficient number, since it is larger than the sum of its proper divisors (584703).
1345905601 is an equidigital number, since it uses as much as digits as its factorization.
1345905601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584702.
The product of its (nonzero) digits is 16200, while the sum is 34.
The square root of 1345905601 is about 36686.5861180895. The cubic root of 1345905601 is about 1104.0909925636.
The spelling of 1345905601 in words is "one billion, three hundred forty-five million, nine hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •