Base | Representation |
---|---|
bin | 10011010001011001101… |
… | …001101000111101001101 |
3 | 11200121101111201121021200 |
4 | 103101121221220331031 |
5 | 133144234111440203 |
6 | 2452222210420113 |
7 | 164452504250616 |
oct | 23213151507515 |
9 | 4617344647250 |
10 | 1324354015053 |
11 | 470723352163 |
12 | 194803591639 |
13 | 97b69854334 |
14 | 48155c18c0d |
15 | 246b20449a3 |
hex | 13459a68f4d |
1324354015053 has 24 divisors (see below), whose sum is σ = 1930001455200. Its totient is φ = 875057101344.
The previous prime is 1324354015003. The next prime is 1324354015097. The reversal of 1324354015053 is 3505104534231.
1324354015053 is a `hidden beast` number, since 1 + 3 + 243 + 5 + 401 + 5 + 0 + 5 + 3 = 666.
It is not a de Polignac number, because 1324354015053 - 210 = 1324354014029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1324354014999 and 1324354015017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1324354015003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 167398 + ... + 1636071.
It is an arithmetic number, because the mean of its divisors is an integer number (80416727300).
Almost surely, 21324354015053 is an apocalyptic number.
It is an amenable number.
1324354015053 is a deficient number, since it is larger than the sum of its proper divisors (605647440147).
1324354015053 is a wasteful number, since it uses less digits than its factorization.
1324354015053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1804201 (or 1804198 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
Adding to 1324354015053 its reverse (3505104534231), we get a palindrome (4829458549284).
The spelling of 1324354015053 in words is "one trillion, three hundred twenty-four billion, three hundred fifty-four million, fifteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •