Base | Representation |
---|---|
bin | 1010010000011001… |
… | …10001110100110001 |
3 | 112012202000211120111 |
4 | 11020030301310301 |
5 | 42234101323112 |
6 | 2310214341321 |
7 | 253310402500 |
oct | 51014616461 |
9 | 15182024514 |
10 | 5506276657 |
11 | 2376171172 |
12 | 109805a841 |
13 | 699a0088b |
14 | 3a340c837 |
15 | 22360e5a7 |
hex | 148331d31 |
5506276657 has 24 divisors (see below), whose sum is σ = 6540052320. Its totient is φ = 4620994560.
The previous prime is 5506276651. The next prime is 5506276663. The reversal of 5506276657 is 7566726055.
It is an interprime number because it is at equal distance from previous prime (5506276651) and next prime (5506276663).
It is not a de Polignac number, because 5506276657 - 23 = 5506276649 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
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 5506276657.
It is not an unprimeable number, because it can be changed into a prime (5506276651) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 739282 + ... + 746692.
It is an arithmetic number, because the mean of its divisors is an integer number (272502180).
Almost surely, 25506276657 is an apocalyptic number.
It is an amenable number.
5506276657 is a deficient number, since it is larger than the sum of its proper divisors (1033775663).
5506276657 is a wasteful number, since it uses less digits than its factorization.
5506276657 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7741 (or 7734 counting only the distinct ones).
The product of its (nonzero) digits is 2646000, while the sum is 49.
The square root of 5506276657 is about 74204.2900174916. The cubic root of 5506276657 is about 1765.8453907434.
The spelling of 5506276657 in words is "five billion, five hundred six million, two hundred seventy-six thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •