Base | Representation |
---|---|
bin | 10011101010010100000… |
… | …110110111111110001101 |
3 | 11210011102210121010202001 |
4 | 103222110012313332031 |
5 | 134114030231423122 |
6 | 2512404443432301 |
7 | 166420426164610 |
oct | 23522406677615 |
9 | 4704383533661 |
10 | 1351104561037 |
11 | 481000335300 |
12 | 199a2a225691 |
13 | 9a540953b7a |
14 | 49572884177 |
15 | 2522a752527 |
hex | 13a941b7f8d |
1351104561037 has 24 divisors (see below), whose sum is σ = 1700590348800. Its totient is φ = 1050740027040.
The previous prime is 1351104560989. The next prime is 1351104561043. The reversal of 1351104561037 is 7301654011531.
It is not a de Polignac number, because 1351104561037 - 235 = 1316744822669 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1351104560987 and 1351104561005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1351104561437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1135837 + ... + 1998082.
It is an arithmetic number, because the mean of its divisors is an integer number (70857931200).
Almost surely, 21351104561037 is an apocalyptic number.
It is an amenable number.
1351104561037 is a deficient number, since it is larger than the sum of its proper divisors (349485787763).
1351104561037 is a wasteful number, since it uses less digits than its factorization.
1351104561037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3134457 (or 3134446 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 37.
Adding to 1351104561037 its reverse (7301654011531), we get a palindrome (8652758572568).
The spelling of 1351104561037 in words is "one trillion, three hundred fifty-one billion, one hundred four million, five hundred sixty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •