Base | Representation |
---|---|
bin | 10011100110111010… |
… | …01100101101110100 |
3 | 1000011122100102021100 |
4 | 21303131030231310 |
5 | 133024400444232 |
6 | 4500325250100 |
7 | 521603520552 |
oct | 116335145564 |
9 | 30148312240 |
10 | 10526968692 |
11 | 4512221429 |
12 | 2059563930 |
13 | cb9c25876 |
14 | 71c138bd2 |
15 | 4192a1c7c |
hex | 27374cb74 |
10526968692 has 36 divisors (see below), whose sum is σ = 26779341316. Its totient is φ = 3486637440.
The previous prime is 10526968657. The next prime is 10526968757. The reversal of 10526968692 is 29686962501.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 7815267216 + 2711701476 = 88404^2 + 52074^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×105269686922 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 925609 + ... + 936912.
Almost surely, 210526968692 is an apocalyptic number.
10526968692 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10526968692 is an abundant number, since it is smaller than the sum of its proper divisors (16252372624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10526968692 is a wasteful number, since it uses less digits than its factorization.
10526968692 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1862688 (or 1862683 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 54.
The spelling of 10526968692 in words is "ten billion, five hundred twenty-six million, nine hundred sixty-eight thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •