Base | Representation |
---|---|
bin | 1000110111101011… |
… | …11100100001110000 |
3 | 110021212201102110000 |
4 | 10123311330201300 |
5 | 34223043444210 |
6 | 2104312110000 |
7 | 226003062021 |
oct | 43365744160 |
9 | 13255642400 |
10 | 4762093680 |
11 | 2024094513 |
12 | b0a995300 |
13 | 5ab791a16 |
14 | 332652c48 |
15 | 1cd110ac0 |
hex | 11bd7c870 |
4762093680 has 200 divisors, whose sum is σ = 16767690192. Its totient is φ = 1252371456.
The previous prime is 4762093639. The next prime is 4762093723. The reversal of 4762093680 is 863902674.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 468007 + ... + 478073.
Almost surely, 24762093680 is an apocalyptic number.
4762093680 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4762093680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8383845096).
4762093680 is an abundant number, since it is smaller than the sum of its proper divisors (12005596512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4762093680 is a wasteful number, since it uses less digits than its factorization.
4762093680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10165 (or 10150 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 45.
The square root of 4762093680 is about 69007.9247623054. The cubic root of 4762093680 is about 1682.4131138312.
The spelling of 4762093680 in words is "four billion, seven hundred sixty-two million, ninety-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.271 sec. • engine limits •