Base | Representation |
---|---|
bin | 10100100100000000100… |
… | …001001000011110101111 |
3 | 12000002100002101010120210 |
4 | 110210000201020132233 |
5 | 141122413022111441 |
6 | 3001051512113503 |
7 | 204042524456346 |
oct | 24440041103657 |
9 | 5002302333523 |
10 | 1413052925871 |
11 | 4a52aa5a1734 |
12 | 1a9a38695893 |
13 | a3333c49952 |
14 | 4c56bdd0b5d |
15 | 26b54068616 |
hex | 149008487af |
1413052925871 has 8 divisors (see below), whose sum is σ = 1884237922224. Its totient is φ = 941951606720.
The previous prime is 1413052925833. The next prime is 1413052925873. The reversal of 1413052925871 is 1785292503141.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1413052925871 - 230 = 1411979184047 is a prime.
It is a super-2 number, since 2×14130529258712 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1413052925871.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1413052925873) 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, 20879886 + ... + 20947451.
It is an arithmetic number, because the mean of its divisors is an integer number (235529740278).
Almost surely, 21413052925871 is an apocalyptic number.
1413052925871 is a deficient number, since it is larger than the sum of its proper divisors (471184996353).
1413052925871 is a wasteful number, since it uses less digits than its factorization.
1413052925871 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41838601.
The product of its (nonzero) digits is 604800, while the sum is 48.
The spelling of 1413052925871 in words is "one trillion, four hundred thirteen billion, fifty-two million, nine hundred twenty-five thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.288 sec. • engine limits •