Base | Representation |
---|---|
bin | 10011000101001100000… |
… | …101001110111011010001 |
3 | 11122100112200011001221012 |
4 | 103011030011032323101 |
5 | 132440410303344203 |
6 | 2442213115140305 |
7 | 163506533362415 |
oct | 23051405167321 |
9 | 4570480131835 |
10 | 1311241465553 |
11 | 466104694698 |
12 | 192164144695 |
13 | 9685a0669c6 |
14 | 47670552d45 |
15 | 24195caebd8 |
hex | 1314c14eed1 |
1311241465553 has 16 divisors (see below), whose sum is σ = 1344887715072. Its totient is φ = 1277740170000.
The previous prime is 1311241465531. The next prime is 1311241465559. The reversal of 1311241465553 is 3555641421131.
It is a cyclic number.
It is not a de Polignac number, because 1311241465553 - 216 = 1311241400017 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1311241465553.
It is not an unprimeable number, because it can be changed into a prime (1311241465559) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 85521098 + ... + 85536428.
It is an arithmetic number, because the mean of its divisors is an integer number (84055482192).
Almost surely, 21311241465553 is an apocalyptic number.
It is an amenable number.
1311241465553 is a deficient number, since it is larger than the sum of its proper divisors (33646249519).
1311241465553 is a wasteful number, since it uses less digits than its factorization.
1311241465553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19916.
The product of its digits is 216000, while the sum is 41.
Adding to 1311241465553 its reverse (3555641421131), we get a palindrome (4866882886684).
The spelling of 1311241465553 in words is "one trillion, three hundred eleven billion, two hundred forty-one million, four hundred sixty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •