Base | Representation |
---|---|
bin | 10011100101000011101… |
… | …100001100100101110001 |
3 | 11202121212110011012221110 |
4 | 103211003230030211301 |
5 | 134021000332014100 |
6 | 2510032422143533 |
7 | 166130522620005 |
oct | 23450354144561 |
9 | 4677773135843 |
10 | 1345460423025 |
11 | 479674372934 |
12 | 198913b81ba9 |
13 | 99b51514534 |
14 | 4919902a705 |
15 | 24ee9eb0250 |
hex | 13943b0c971 |
1345460423025 has 48 divisors (see below), whose sum is σ = 2357288856000. Its totient is φ = 675248981760.
The previous prime is 1345460423023. The next prime is 1345460423057. The reversal of 1345460423025 is 5203240645431.
It is not a de Polignac number, because 1345460423025 - 21 = 1345460423023 is a prime.
It is a super-2 number, since 2×13454604230252 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1345460423023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2956074 + ... + 3380723.
It is an arithmetic number, because the mean of its divisors is an integer number (49110184500).
Almost surely, 21345460423025 is an apocalyptic number.
1345460423025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1345460423025 is a deficient number, since it is larger than the sum of its proper divisors (1011828432975).
1345460423025 is a wasteful number, since it uses less digits than its factorization.
1345460423025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6336978 (or 6336973 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 39.
The spelling of 1345460423025 in words is "one trillion, three hundred forty-five billion, four hundred sixty million, four hundred twenty-three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •