Base | Representation |
---|---|
bin | 1000111001101100… |
… | …10001100001100100 |
3 | 110100001110011102201 |
4 | 10130312101201210 |
5 | 34241403110100 |
6 | 2110113344244 |
7 | 226266314644 |
oct | 43466214144 |
9 | 13301404381 |
10 | 4778956900 |
11 | 2032662063 |
12 | b14568084 |
13 | 5b2117463 |
14 | 3349a2524 |
15 | 1ce84236a |
hex | 11cd91864 |
4778956900 has 81 divisors (see below), whose sum is σ = 10763922393. Its totient is φ = 1841623200.
The previous prime is 4778956883. The next prime is 4778956901. The reversal of 4778956900 is 96598774.
The square root of 4778956900 is 69130.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1720424484 + 3058532416 = 41478^2 + 55304^2 .
It is a super-2 number, since 2×47789569002 = 45676858104115220000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4778956901) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 21430189 + ... + 21430411.
Almost surely, 24778956900 is an apocalyptic number.
4778956900 is the 69130-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4778956900
4778956900 is an abundant number, since it is smaller than the sum of its proper divisors (5984965493).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4778956900 is a wasteful number, since it uses less digits than its factorization.
4778956900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 522 (or 261 counting only the distinct ones).
The product of its (nonzero) digits is 3810240, while the sum is 55.
The cubic root of 4778956900 is about 1684.3966587238.
The spelling of 4778956900 in words is "four billion, seven hundred seventy-eight million, nine hundred fifty-six thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •