Base | Representation |
---|---|
bin | 1001101101110000… |
… | …01100000100101101 |
3 | 111110111012022100111 |
4 | 10312320030010231 |
5 | 41140202311402 |
6 | 2221313500021 |
7 | 243151301500 |
oct | 46670140455 |
9 | 14414168314 |
10 | 5215666477 |
11 | 223712046a |
12 | 1016871611 |
13 | 65173c9a8 |
14 | 3769a1137 |
15 | 207d579d7 |
hex | 136e0c12d |
5215666477 has 12 divisors (see below), whose sum is σ = 6107931900. Its totient is φ = 4440561216.
The previous prime is 5215666471. The next prime is 5215666481. The reversal of 5215666477 is 7746665125.
It can be written as a sum of positive squares in 2 ways, for example, as 200335716 + 5015330761 = 14154^2 + 70819^2 .
It is not a de Polignac number, because 5215666477 - 231 = 3068182829 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a self number, because there is not a number n which added to its sum of digits gives 5215666477.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5215666471) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 349888 + ... + 364489.
It is an arithmetic number, because the mean of its divisors is an integer number (508994325).
Almost surely, 25215666477 is an apocalyptic number.
It is an amenable number.
5215666477 is a deficient number, since it is larger than the sum of its proper divisors (892265423).
5215666477 is a wasteful number, since it uses less digits than its factorization.
5215666477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714540 (or 714533 counting only the distinct ones).
The product of its digits is 2116800, while the sum is 49.
The square root of 5215666477 is about 72219.5712878441. The cubic root of 5215666477 is about 1734.2163272255.
The spelling of 5215666477 in words is "five billion, two hundred fifteen million, six hundred sixty-six thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •