Base | Representation |
---|---|
bin | 10100100100101010110… |
… | …110010110001110000001 |
3 | 12000011011120202020211100 |
4 | 110210222312112032001 |
5 | 141130341330131431 |
6 | 3001250202205013 |
7 | 204066240221130 |
oct | 24445266261601 |
9 | 5004146666740 |
10 | 1413763130241 |
11 | 4a56344807a0 |
12 | 1a9bb64b3769 |
13 | a341811c917 |
14 | 4c5d8463917 |
15 | 26b965a44e6 |
hex | 1492ad96381 |
1413763130241 has 96 divisors (see below), whose sum is σ = 2702493870336. Its totient is φ = 689495040000.
The previous prime is 1413763130203. The next prime is 1413763130293. The reversal of 1413763130241 is 1420313673141.
1413763130241 is a `hidden beast` number, since 1 + 4 + 13 + 7 + 631 + 3 + 0 + 2 + 4 + 1 = 666.
It is not a de Polignac number, because 1413763130241 - 222 = 1413758935937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1413763130196 and 1413763130205.
It is not an unprimeable number, because it can be changed into a prime (1413763130041) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4574551 + ... + 4873811.
It is an arithmetic number, because the mean of its divisors is an integer number (28150977816).
Almost surely, 21413763130241 is an apocalyptic number.
1413763130241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1413763130241 is a deficient number, since it is larger than the sum of its proper divisors (1288730740095).
1413763130241 is a wasteful number, since it uses less digits than its factorization.
1413763130241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 299703 (or 299700 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
The spelling of 1413763130241 in words is "one trillion, four hundred thirteen billion, seven hundred sixty-three million, one hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •