Base | Representation |
---|---|
bin | 10100100011001010001… |
… | …110110011001110011001 |
3 | 11222222222121120221201121 |
4 | 110203022032303032121 |
5 | 141114031342304203 |
6 | 3000421255045241 |
7 | 204011125141621 |
oct | 24431216631631 |
9 | 4888877527647 |
10 | 1412142150553 |
11 | 4a498247a762 |
12 | 1a9823670821 |
13 | a321a34c844 |
14 | 4c4c306b881 |
15 | 26aee10e0bd |
hex | 148ca3b3399 |
1412142150553 has 8 divisors (see below), whose sum is σ = 1454036468040. Its totient is φ = 1370444060160.
The previous prime is 1412142150541. The next prime is 1412142150571. The reversal of 1412142150553 is 3550512412141.
It can be written as a sum of positive squares in 4 ways, for example, as 821437694224 + 590704456329 = 906332^2 + 768573^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1412142150553 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1412142150053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49042168 + ... + 49070953.
It is an arithmetic number, because the mean of its divisors is an integer number (181754558505).
Almost surely, 21412142150553 is an apocalyptic number.
It is an amenable number.
1412142150553 is a deficient number, since it is larger than the sum of its proper divisors (41894317487).
1412142150553 is an equidigital number, since it uses as much as digits as its factorization.
1412142150553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98113547.
The product of its (nonzero) digits is 24000, while the sum is 34.
Adding to 1412142150553 its reverse (3550512412141), we get a palindrome (4962654562694).
The spelling of 1412142150553 in words is "one trillion, four hundred twelve billion, one hundred forty-two million, one hundred fifty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •