Base | Representation |
---|---|
bin | 10011100110110011… |
… | …01101111010000000 |
3 | 1000011120122001101022 |
4 | 21303121231322000 |
5 | 133024132243224 |
6 | 4500253525012 |
7 | 521563000046 |
oct | 116331557200 |
9 | 30146561338 |
10 | 10526056064 |
11 | 4511758797 |
12 | 20591a3768 |
13 | cb9996354 |
14 | 71bd7c396 |
15 | 41917165e |
hex | 27366de80 |
10526056064 has 32 divisors (see below), whose sum is σ = 21235339200. Its totient is φ = 5196402432.
The previous prime is 10526056027. The next prime is 10526056067. The reversal of 10526056064 is 46065062501.
10526056064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×105260560642 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10526056067) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 510362 + ... + 530585.
It is an arithmetic number, because the mean of its divisors is an integer number (663604350).
Almost surely, 210526056064 is an apocalyptic number.
It is an amenable number.
10526056064 is an abundant number, since it is smaller than the sum of its proper divisors (10709283136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10526056064 is an equidigital number, since it uses as much as digits as its factorization.
10526056064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1041040 (or 1041028 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 35.
The spelling of 10526056064 in words is "ten billion, five hundred twenty-six million, fifty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •