Base | Representation |
---|---|
bin | 10011100100101110010… |
… | …110010011010111000100 |
3 | 11202120221111101211121221 |
4 | 103210232112103113010 |
5 | 134014232201041202 |
6 | 2505533111450124 |
7 | 166115614300321 |
oct | 23445626232704 |
9 | 4676844354557 |
10 | 1345102362052 |
11 | 479500242379 |
12 | 198834086944 |
13 | 99ac5298237 |
14 | 49163661b48 |
15 | 24ec8833037 |
hex | 1392e5935c4 |
1345102362052 has 12 divisors (see below), whose sum is σ = 2492395553340. Its totient is φ = 632989346816.
The previous prime is 1345102362017. The next prime is 1345102362053. The reversal of 1345102362052 is 2502632015431.
It can be written as a sum of positive squares in 2 ways, for example, as 1253714653636 + 91387708416 = 1119694^2 + 302304^2 .
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a junction number, because it is equal to n+sod(n) for n = 1345102361999 and 1345102362017.
It is not an unprimeable number, because it can be changed into a prime (1345102362053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9890458477 + ... + 9890458612.
It is an arithmetic number, because the mean of its divisors is an integer number (207699629445).
Almost surely, 21345102362052 is an apocalyptic number.
It is an amenable number.
1345102362052 is a deficient number, since it is larger than the sum of its proper divisors (1147293191288).
1345102362052 is a wasteful number, since it uses less digits than its factorization.
1345102362052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19780917110 (or 19780917108 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 1345102362052 its reverse (2502632015431), we get a palindrome (3847734377483).
The spelling of 1345102362052 in words is "one trillion, three hundred forty-five billion, one hundred two million, three hundred sixty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •