Base | Representation |
---|---|
bin | 11100100001101000111… |
… | …001101111110011111001 |
3 | 20221101210020112112020021 |
4 | 130201220321233303321 |
5 | 224104110323233411 |
6 | 4100311111130441 |
7 | 261424124022535 |
oct | 34415071576371 |
9 | 6841706475207 |
10 | 1960265055481 |
11 | 696386579967 |
12 | 277ab4973a21 |
13 | 112b10396195 |
14 | 6ac3d59abc5 |
15 | 35ece900a71 |
hex | 1c868e6fcf9 |
1960265055481 has 4 divisors (see below), whose sum is σ = 1960292333412. Its totient is φ = 1960237777552.
The previous prime is 1960265055479. The next prime is 1960265055563. The reversal of 1960265055481 is 1845505620691.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 67439415481 + 1892825640000 = 259691^2 + 1375800^2 .
It is a cyclic number.
It is not a de Polignac number, because 1960265055481 - 21 = 1960265055479 is a prime.
It is a super-2 number, since 2×19602650554812 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1960262055481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13530886 + ... + 13674991.
It is an arithmetic number, because the mean of its divisors is an integer number (490073083353).
Almost surely, 21960265055481 is an apocalyptic number.
It is an amenable number.
1960265055481 is a deficient number, since it is larger than the sum of its proper divisors (27277931).
1960265055481 is an equidigital number, since it uses as much as digits as its factorization.
1960265055481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27277930.
The product of its (nonzero) digits is 2592000, while the sum is 52.
The spelling of 1960265055481 in words is "one trillion, nine hundred sixty billion, two hundred sixty-five million, fifty-five thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •