Base | Representation |
---|---|
bin | 10011100101000000011… |
… | …010011011011110001101 |
3 | 11202121201121200110211022 |
4 | 103211000122123132031 |
5 | 134020342242334431 |
6 | 2510023135403525 |
7 | 166126254332255 |
oct | 23450032333615 |
9 | 4677647613738 |
10 | 1345405433741 |
11 | 479646324646 |
12 | 1988b96835a5 |
13 | 99b430001b5 |
14 | 491919d4965 |
15 | 24ee524c07b |
hex | 1394069b78d |
1345405433741 has 2 divisors, whose sum is σ = 1345405433742. Its totient is φ = 1345405433740.
The previous prime is 1345405433689. The next prime is 1345405433789. The reversal of 1345405433741 is 1473345045431.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1345242743716 + 162690025 = 1159846^2 + 12755^2 .
It is a cyclic number.
It is not a de Polignac number, because 1345405433741 - 238 = 1070527526797 is a prime.
It is a super-2 number, since 2×13454054337412 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1345405433692 and 1345405433701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1345405433041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 672702716870 + 672702716871.
It is an arithmetic number, because the mean of its divisors is an integer number (672702716871).
Almost surely, 21345405433741 is an apocalyptic number.
It is an amenable number.
1345405433741 is a deficient number, since it is larger than the sum of its proper divisors (1).
1345405433741 is an equidigital number, since it uses as much as digits as its factorization.
1345405433741 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1209600, while the sum is 44.
The spelling of 1345405433741 in words is "one trillion, three hundred forty-five billion, four hundred five million, four hundred thirty-three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •