Base | Representation |
---|---|
bin | 10011100001000110… |
… | …10101010010000100 |
3 | 1000001020122222221000 |
4 | 21300203111102010 |
5 | 132424412314441 |
6 | 4451425053300 |
7 | 520442420142 |
oct | 116043252204 |
9 | 30036588830 |
10 | 10478244996 |
11 | 449777260a |
12 | 2045187230 |
13 | cacac638b |
14 | 715894592 |
15 | 414d7a2b6 |
hex | 2708d5484 |
10478244996 has 48 divisors (see below), whose sum is σ = 27274121280. Its totient is φ = 3478824000.
The previous prime is 10478244983. The next prime is 10478245009. The reversal of 10478244996 is 69944287401.
10478244996 is a `hidden beast` number, since 104 + 7 + 8 + 2 + 449 + 96 = 666.
It is an interprime number because it is at equal distance from previous prime (10478244983) and next prime (10478245009).
It is a super-3 number, since 3×104782449963 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 166161 + ... + 220376.
It is an arithmetic number, because the mean of its divisors is an integer number (568210860).
Almost surely, 210478244996 is an apocalyptic number.
It is an amenable number.
10478244996 is an abundant number, since it is smaller than the sum of its proper divisors (16795876284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10478244996 is a wasteful number, since it uses less digits than its factorization.
10478244996 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386801 (or 386793 counting only the distinct ones).
The product of its (nonzero) digits is 3483648, while the sum is 54.
The spelling of 10478244996 in words is "ten billion, four hundred seventy-eight million, two hundred forty-four thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •