Base | Representation |
---|---|
bin | 1010011001001110… |
… | …10101110011111111 |
3 | 112101220102002021102 |
4 | 11030213111303333 |
5 | 42412032124141 |
6 | 2321422123315 |
7 | 255200116052 |
oct | 51447256377 |
9 | 15356362242 |
10 | 5580348671 |
11 | 2403a63607 |
12 | 10b8a2053b |
13 | 6ac166981 |
14 | 3ad1b0a99 |
15 | 229d9199b |
hex | 14c9d5cff |
5580348671 has 4 divisors (see below), whose sum is σ = 5608675512. Its totient is φ = 5552021832.
The previous prime is 5580348667. The next prime is 5580348673. The reversal of 5580348671 is 1768430855.
5580348671 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5580348671 - 22 = 5580348667 is a prime.
It is a super-2 number, since 2×55803486712 = 62280582579862932482, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5580348673) 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, 14163125 + ... + 14163518.
It is an arithmetic number, because the mean of its divisors is an integer number (1402168878).
Almost surely, 25580348671 is an apocalyptic number.
5580348671 is a deficient number, since it is larger than the sum of its proper divisors (28326841).
5580348671 is a wasteful number, since it uses less digits than its factorization.
5580348671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28326840.
The product of its (nonzero) digits is 806400, while the sum is 47.
The square root of 5580348671 is about 74701.7313788643. The cubic root of 5580348671 is about 1773.7283673628.
The spelling of 5580348671 in words is "five billion, five hundred eighty million, three hundred forty-eight thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •