Base | Representation |
---|---|
bin | 10011101010011101101… |
… | …000011011000101010000 |
3 | 11210011211221021021201221 |
4 | 103222131220123011100 |
5 | 134114342133204134 |
6 | 2512432352334424 |
7 | 166424406316333 |
oct | 23523550330520 |
9 | 4704757237657 |
10 | 1351264350544 |
11 | 481082553549 |
12 | 199a73844414 |
13 | 9a567a9c884 |
14 | 49589b9a61a |
15 | 252397b75b4 |
hex | 13a9da1b150 |
1351264350544 has 20 divisors (see below), whose sum is σ = 2619764898100. Its totient is φ = 675195989760.
The previous prime is 1351264350529. The next prime is 1351264350581. The reversal of 1351264350544 is 4450534621531.
It can be written as a sum of positive squares in 2 ways, for example, as 603281530944 + 747982819600 = 776712^2 + 864860^2 .
It is a super-2 number, since 2×13512643505442 (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 1351264350544.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27236037 + ... + 27285604.
It is an arithmetic number, because the mean of its divisors is an integer number (130988244905).
Almost surely, 21351264350544 is an apocalyptic number.
It is an amenable number.
1351264350544 is a deficient number, since it is larger than the sum of its proper divisors (1268500547556).
1351264350544 is a wasteful number, since it uses less digits than its factorization.
1351264350544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54523198 (or 54523192 counting only the distinct ones).
The product of its (nonzero) digits is 864000, while the sum is 43.
The spelling of 1351264350544 in words is "one trillion, three hundred fifty-one billion, two hundred sixty-four million, three hundred fifty thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •