Base | Representation |
---|---|
bin | 1010010001101000… |
… | …01111001101110110 |
3 | 112020110111100212210 |
4 | 11020310033031312 |
5 | 42244223330122 |
6 | 2311224154250 |
7 | 253464334110 |
oct | 51064171566 |
9 | 15213440783 |
10 | 5516620662 |
11 | 2380a96833 |
12 | 109b608986 |
13 | 69bbb2ba7 |
14 | 3a49423b0 |
15 | 2244a440c |
hex | 148d0f376 |
5516620662 has 32 divisors (see below), whose sum is σ = 12654319104. Its totient is φ = 1570564800.
The previous prime is 5516620661. The next prime is 5516620663. The reversal of 5516620662 is 2660266155.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (5516620661) and next prime (5516620663).
It is a self number, because there is not a number n which added to its sum of digits gives 5516620662.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5516620661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 221914 + ... + 245517.
It is an arithmetic number, because the mean of its divisors is an integer number (395447472).
Almost surely, 25516620662 is an apocalyptic number.
5516620662 is an abundant number, since it is smaller than the sum of its proper divisors (7137698442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5516620662 is a wasteful number, since it uses less digits than its factorization.
5516620662 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467724.
The product of its (nonzero) digits is 129600, while the sum is 39.
The square root of 5516620662 is about 74273.9568220248. The cubic root of 5516620662 is about 1766.9504621974.
The spelling of 5516620662 in words is "five billion, five hundred sixteen million, six hundred twenty thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •