Base | Representation |
---|---|
bin | 100110001001… |
… | …101010011100 |
3 | 200211002212100 |
4 | 212021222130 |
5 | 10030013202 |
6 | 554205100 |
7 | 151002405 |
oct | 46115234 |
9 | 20732770 |
10 | 10001052 |
11 | 5710a36 |
12 | 3423790 |
13 | 20c21a9 |
14 | 14849ac |
15 | d2841c |
hex | 989a9c |
10001052 has 36 divisors (see below), whose sum is σ = 25381720. Its totient is φ = 3320352.
The previous prime is 10001009. The next prime is 10001053. The reversal of 10001052 is 25010001.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×100010522 = 200042082213408, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001053) 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 11 ways as a sum of consecutive naturals, for example, 13278 + ... + 14010.
Almost surely, 210001052 is an apocalyptic number.
10001052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10001052 is an abundant number, since it is smaller than the sum of its proper divisors (15380668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001052 is a wasteful number, since it uses less digits than its factorization.
10001052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1122 (or 1117 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 9.
The square root of 10001052 is about 3162.4439915989. The cubic root of 10001052 is about 215.4510236226.
Adding to 10001052 its reverse (25010001), we get a palindrome (35011053).
The spelling of 10001052 in words is "ten million, one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •