Base | Representation |
---|---|
bin | 10011100100110000110… |
… | …101010111100110110101 |
3 | 11202121001101212022221000 |
4 | 103210300311113212311 |
5 | 134014323334412331 |
6 | 2505541201313513 |
7 | 166116631600554 |
oct | 23446065274665 |
9 | 4677041768830 |
10 | 1345144060341 |
11 | 479521832974 |
12 | 198846035899 |
13 | 99b00b07a93 |
14 | 49168dd7d9b |
15 | 24ecc31d0e6 |
hex | 13930d579b5 |
1345144060341 has 16 divisors (see below), whose sum is σ = 1992892377600. Its totient is φ = 896723843904.
The previous prime is 1345144060331. The next prime is 1345144060343. The reversal of 1345144060341 is 1430604415431.
1345144060341 is a `hidden beast` number, since 1 + 3 + 4 + 5 + 1 + 4 + 4 + 0 + 603 + 41 = 666.
It is not a de Polignac number, because 1345144060341 - 218 = 1345143798197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1345144060296 and 1345144060305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1345144060343) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 438036 + ... + 1697693.
It is an arithmetic number, because the mean of its divisors is an integer number (124555773600).
Almost surely, 21345144060341 is an apocalyptic number.
It is an amenable number.
1345144060341 is a deficient number, since it is larger than the sum of its proper divisors (647748317259).
1345144060341 is a wasteful number, since it uses less digits than its factorization.
1345144060341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2159065 (or 2159059 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
Adding to 1345144060341 its reverse (1430604415431), we get a palindrome (2775748475772).
The spelling of 1345144060341 in words is "one trillion, three hundred forty-five billion, one hundred forty-four million, sixty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •