Base | Representation |
---|---|
bin | 10100011000100011… |
… | …11111011001011000 |
3 | 1001020200001102020121 |
4 | 22030101333121120 |
5 | 134403011222302 |
6 | 5005524203024 |
7 | 535121611654 |
oct | 121421773130 |
9 | 31220042217 |
10 | 10943460952 |
11 | 4706331206 |
12 | 2154b39474 |
13 | 10552bcaa8 |
14 | 75b593a64 |
15 | 440b21e37 |
hex | 28c47f658 |
10943460952 has 32 divisors (see below), whose sum is σ = 20994584400. Its totient is φ = 5346307584.
The previous prime is 10943460943. The next prime is 10943460971. The reversal of 10943460952 is 25906434901.
10943460952 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10943460899 and 10943460908.
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 7 ways as a sum of consecutive naturals, for example, 25077 + ... + 150052.
Almost surely, 210943460952 is an apocalyptic number.
It is an amenable number.
10943460952 is a deficient number, since it is larger than the sum of its proper divisors (10051123448).
10943460952 is a wasteful number, since it uses less digits than its factorization.
10943460952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175315 (or 175311 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 43.
The spelling of 10943460952 in words is "ten billion, nine hundred forty-three million, four hundred sixty thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •