Base | Representation |
---|---|
bin | 1001000101101010… |
… | …01001100111001110 |
3 | 110121001022102110200 |
4 | 10202311021213032 |
5 | 34443101410041 |
6 | 2124100514330 |
7 | 231625404126 |
oct | 44265114716 |
9 | 13531272420 |
10 | 4879325646 |
11 | 2084285638 |
12 | b420ab9a6 |
13 | 5c9b59a50 |
14 | 34404bc86 |
15 | 1d856b1b6 |
hex | 122d499ce |
4879325646 has 48 divisors (see below), whose sum is σ = 11415820416. Its totient is φ = 1497279168.
The previous prime is 4879325629. The next prime is 4879325651. The reversal of 4879325646 is 6465239784.
4879325646 is a `hidden beast` number, since 4 + 8 + 79 + 3 + 2 + 564 + 6 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 4879325592 and 4879325601.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 59331 + ... + 115233.
It is an arithmetic number, because the mean of its divisors is an integer number (237829592).
Almost surely, 24879325646 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4879325646, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5707910208).
4879325646 is an abundant number, since it is smaller than the sum of its proper divisors (6536494770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4879325646 is a wasteful number, since it uses less digits than its factorization.
4879325646 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56297 (or 56294 counting only the distinct ones).
The product of its digits is 8709120, while the sum is 54.
The square root of 4879325646 is about 69852.1699448199. The cubic root of 4879325646 is about 1696.1070836827.
The spelling of 4879325646 in words is "four billion, eight hundred seventy-nine million, three hundred twenty-five thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •