Base | Representation |
---|---|
bin | 1001100000110000… |
… | …11000011011000000 |
3 | 111011220002110122101 |
4 | 10300120120123000 |
5 | 40424301241102 |
6 | 2202421320144 |
7 | 240355636411 |
oct | 46030303300 |
9 | 14156073571 |
10 | 5106665152 |
11 | 2190641126 |
12 | ba6266054 |
13 | 634c97074 |
14 | 366309808 |
15 | 1ed4c5e87 |
hex | 1306186c0 |
5106665152 has 28 divisors (see below), whose sum is σ = 10141747560. Its totient is φ = 2551264256.
The previous prime is 5106665101. The next prime is 5106665153. The reversal of 5106665152 is 2515666015.
It is not an unprimeable number, because it can be changed into a prime (5106665153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48888 + ... + 112264.
It is an arithmetic number, because the mean of its divisors is an integer number (362205270).
Almost surely, 25106665152 is an apocalyptic number.
It is an amenable number.
5106665152 is a deficient number, since it is larger than the sum of its proper divisors (5035082408).
5106665152 is a wasteful number, since it uses less digits than its factorization.
5106665152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64648 (or 64638 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 37.
The square root of 5106665152 is about 71460.9344467311. The cubic root of 5106665152 is about 1722.0501459567.
The spelling of 5106665152 in words is "five billion, one hundred six million, six hundred sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •