Base | Representation |
---|---|
bin | 111101011010111… |
… | …1010110111111101 |
3 | 12022122001100221121 |
4 | 1322311322313331 |
5 | 13210101031013 |
6 | 540301230541 |
7 | 102033554356 |
oct | 17265726775 |
9 | 5278040847 |
10 | 2060955133 |
11 | 9683a0106 |
12 | 496262451 |
13 | 26ac99ca3 |
14 | 157a04d2d |
15 | c0e0358d |
hex | 7ad7adfd |
2060955133 has 8 divisors (see below), whose sum is σ = 2088143928. Its totient is φ = 2033923584.
The previous prime is 2060955109. The next prime is 2060955161. The reversal of 2060955133 is 3315590602.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 353364804 + 1707590329 = 18798^2 + 41323^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2060955133 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 (2060955103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12810 + ... + 65467.
It is an arithmetic number, because the mean of its divisors is an integer number (261017991).
Almost surely, 22060955133 is an apocalyptic number.
It is an amenable number.
2060955133 is a deficient number, since it is larger than the sum of its proper divisors (27188795).
2060955133 is a wasteful number, since it uses less digits than its factorization.
2060955133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78623.
The product of its (nonzero) digits is 24300, while the sum is 34.
The square root of 2060955133 is about 45397.7436994395. The cubic root of 2060955133 is about 1272.5929484124.
The spelling of 2060955133 in words is "two billion, sixty million, nine hundred fifty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •