Base | Representation |
---|---|
bin | 10011101001011001011… |
… | …111010011101110110101 |
3 | 11210001220021001200011100 |
4 | 103221121133103232311 |
5 | 134110022001013303 |
6 | 2512123113000313 |
7 | 166354155042003 |
oct | 23513137235665 |
9 | 4701807050140 |
10 | 1350121110453 |
11 | 480646195325 |
12 | 1997b49b3099 |
13 | 9a414c8c64b |
14 | 494bc003a73 |
15 | 251be23e8a3 |
hex | 13a597d3bb5 |
1350121110453 has 24 divisors (see below), whose sum is σ = 1956155554080. Its totient is φ = 897323375520.
The previous prime is 1350121110451. The next prime is 1350121110461. The reversal of 1350121110453 is 3540111210531.
1350121110453 is a `hidden beast` number, since 1 + 3 + 501 + 2 + 1 + 1 + 104 + 53 = 666.
It is not a de Polignac number, because 1350121110453 - 21 = 1350121110451 is a prime.
It is a super-3 number, since 3×13501211104533 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1350121110451) 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, 5471683 + ... + 5713103.
It is an arithmetic number, because the mean of its divisors is an integer number (81506481420).
Almost surely, 21350121110453 is an apocalyptic number.
It is an amenable number.
1350121110453 is a deficient number, since it is larger than the sum of its proper divisors (606034443627).
1350121110453 is a wasteful number, since it uses less digits than its factorization.
1350121110453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243329 (or 243326 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
Adding to 1350121110453 its reverse (3540111210531), we get a palindrome (4890232320984).
The spelling of 1350121110453 in words is "one trillion, three hundred fifty billion, one hundred twenty-one million, one hundred ten thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •