Base | Representation |
---|---|
bin | 111010101001110… |
… | …1001110000100111 |
3 | 12002011022010112010 |
4 | 1311103221300213 |
5 | 13012312223210 |
6 | 523142525303 |
7 | 66525312135 |
oct | 16523516047 |
9 | 5064263463 |
10 | 1968086055 |
11 | 91aa2a201 |
12 | 46b136833 |
13 | 254982180 |
14 | 14954c755 |
15 | b7bab920 |
hex | 754e9c27 |
1968086055 has 32 divisors (see below), whose sum is σ = 3482829504. Its totient is φ = 942713856.
The previous prime is 1968086053. The next prime is 1968086077. The reversal of 1968086055 is 5506808691.
It is not a de Polignac number, because 1968086055 - 21 = 1968086053 is a prime.
It is a super-3 number, since 3×19680860553 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1968085995 and 1968086013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1968086051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 129174 + ... + 143603.
It is an arithmetic number, because the mean of its divisors is an integer number (108838422).
Almost surely, 21968086055 is an apocalyptic number.
1968086055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1968086055 is a deficient number, since it is larger than the sum of its proper divisors (1514743449).
1968086055 is a wasteful number, since it uses less digits than its factorization.
1968086055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272835.
The product of its (nonzero) digits is 518400, while the sum is 48.
The square root of 1968086055 is about 44363.1159297901. The cubic root of 1968086055 is about 1253.1835767213.
The spelling of 1968086055 in words is "one billion, nine hundred sixty-eight million, eighty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •