Base | Representation |
---|---|
bin | 1011000110100110… |
… | …01011101110111111 |
3 | 120101102120011002022 |
4 | 11203103023232333 |
5 | 44202000043404 |
6 | 2423255350355 |
7 | 300501105134 |
oct | 54323135677 |
9 | 16342504068 |
10 | 5960940479 |
11 | 258988289a |
12 | 11a43823bb |
13 | 73cc71320 |
14 | 40796258b |
15 | 24d4be8be |
hex | 1634cbbbf |
5960940479 has 8 divisors (see below), whose sum is σ = 6420818880. Its totient is φ = 5501254176.
The previous prime is 5960940473. The next prime is 5960940511. The reversal of 5960940479 is 9740490695.
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 5960940479 - 228 = 5692505023 is a prime.
It is a super-3 number, since 3×59609404793 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 5960940479.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5960940473) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20009 + ... + 111005.
It is an arithmetic number, because the mean of its divisors is an integer number (802602360).
Almost surely, 25960940479 is an apocalyptic number.
5960940479 is a deficient number, since it is larger than the sum of its proper divisors (459878401).
5960940479 is a wasteful number, since it uses less digits than its factorization.
5960940479 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96049.
The product of its (nonzero) digits is 2449440, while the sum is 53.
The square root of 5960940479 is about 77207.1271256741. The cubic root of 5960940479 is about 1813.1689019917.
The spelling of 5960940479 in words is "five billion, nine hundred sixty million, nine hundred forty thousand, four hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •