Base | Representation |
---|---|
bin | 10011100011000000… |
… | …10001010100100000 |
3 | 1000002100201120220020 |
4 | 21301200101110200 |
5 | 132443010011202 |
6 | 4453155313440 |
7 | 521025252165 |
oct | 116140212440 |
9 | 30070646806 |
10 | 10494219552 |
11 | 44a5793523 |
12 | 204a5ab880 |
13 | cb31ca48b |
14 | 717a5206c |
15 | 4164835bc |
hex | 271811520 |
10494219552 has 48 divisors (see below), whose sum is σ = 28014245280. Its totient is φ = 3438781952.
The previous prime is 10494219511. The next prime is 10494219559. The reversal of 10494219552 is 25591249401.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×104942195522 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10494219559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 920733 + ... + 932060.
It is an arithmetic number, because the mean of its divisors is an integer number (583630110).
Almost surely, 210494219552 is an apocalyptic number.
10494219552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10494219552 is an abundant number, since it is smaller than the sum of its proper divisors (17520025728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10494219552 is a wasteful number, since it uses less digits than its factorization.
10494219552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1852865 (or 1852857 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 42.
The spelling of 10494219552 in words is "ten billion, four hundred ninety-four million, two hundred nineteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •