Base | Representation |
---|---|
bin | 111100010100101… |
… | …100010000001101 |
3 | 2121112100211100100 |
4 | 330110230100031 |
5 | 4033041311401 |
6 | 244231521313 |
7 | 34036225536 |
oct | 7424542015 |
9 | 2545324310 |
10 | 1012057101 |
11 | 47a309530 |
12 | 242b29239 |
13 | 13189c173 |
14 | 985a968d |
15 | 5dcb3b86 |
hex | 3c52c40d |
1012057101 has 24 divisors (see below), whose sum is σ = 1624854816. Its totient is φ = 601791840.
The previous prime is 1012057049. The next prime is 1012057103. The reversal of 1012057101 is 1017502101.
It is a happy number.
It is not a de Polignac number, because 1012057101 - 27 = 1012056973 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012057103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 91195 + ... + 101688.
It is an arithmetic number, because the mean of its divisors is an integer number (67702284).
Almost surely, 21012057101 is an apocalyptic number.
1012057101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012057101 is a deficient number, since it is larger than the sum of its proper divisors (612797715).
1012057101 is a wasteful number, since it uses less digits than its factorization.
1012057101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192953 (or 192950 counting only the distinct ones).
The product of its (nonzero) digits is 70, while the sum is 18.
The square root of 1012057101 is about 31812.8449057924. The cubic root of 1012057101 is about 1004.0029883696.
Adding to 1012057101 its reverse (1017502101), we get a palindrome (2029559202).
The spelling of 1012057101 in words is "one billion, twelve million, fifty-seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •