Base | Representation |
---|---|
bin | 1000100110001111… |
… | …10010100100011100 |
3 | 102220200101202001200 |
4 | 10103013302210130 |
5 | 33423114322130 |
6 | 2042004035500 |
7 | 222245311314 |
oct | 42307624434 |
9 | 12820352050 |
10 | 4615776540 |
11 | 1a59538261 |
12 | a89992b90 |
13 | 58738222b |
14 | 31b046444 |
15 | 1c035c760 |
hex | 1131f291c |
4615776540 has 144 divisors (see below), whose sum is σ = 14196113568. Its totient is φ = 1213857792.
The previous prime is 4615776521. The next prime is 4615776547. The reversal of 4615776540 is 456775164.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4615776547) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5226939 + ... + 5227821.
It is an arithmetic number, because the mean of its divisors is an integer number (98584122).
Almost surely, 24615776540 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4615776540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7098056784).
4615776540 is an abundant number, since it is smaller than the sum of its proper divisors (9580337028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4615776540 is a wasteful number, since it uses less digits than its factorization.
4615776540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1268 (or 1263 counting only the distinct ones).
The product of its (nonzero) digits is 705600, while the sum is 45.
The square root of 4615776540 is about 67939.5064745101. The cubic root of 4615776540 is about 1665.0026350633.
The spelling of 4615776540 in words is "four billion, six hundred fifteen million, seven hundred seventy-six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •