Base | Representation |
---|---|
bin | 10011000101011111001… |
… | …100011000000011100101 |
3 | 11122101101000111020122112 |
4 | 103011133030120003211 |
5 | 132442034344330221 |
6 | 2442305011410405 |
7 | 163520505643445 |
oct | 23053714300345 |
9 | 4571330436575 |
10 | 1311562105061 |
11 | 46625968591a |
12 | 1922335b3a05 |
13 | 968ab610020 |
14 | 476a0d7a125 |
15 | 241b3ee915b |
hex | 1315f3180e5 |
1311562105061 has 8 divisors (see below), whose sum is σ = 1412478382560. Its totient is φ = 1210649668272.
The previous prime is 1311562105043. The next prime is 1311562105097. The reversal of 1311562105061 is 1605012651131.
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 1311562105061 - 26 = 1311562104997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311562135061) 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 7 ways as a sum of consecutive naturals, for example, 230375 + ... + 1635908.
It is an arithmetic number, because the mean of its divisors is an integer number (176559797820).
Almost surely, 21311562105061 is an apocalyptic number.
It is an amenable number.
1311562105061 is a deficient number, since it is larger than the sum of its proper divisors (100916277499).
1311562105061 is a wasteful number, since it uses less digits than its factorization.
1311562105061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1920355.
The product of its (nonzero) digits is 5400, while the sum is 32.
Adding to 1311562105061 its reverse (1605012651131), we get a palindrome (2916574756192).
The spelling of 1311562105061 in words is "one trillion, three hundred eleven billion, five hundred sixty-two million, one hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •