Base | Representation |
---|---|
bin | 111011101010101… |
… | …110011101100101 |
3 | 2120202122220210220 |
4 | 323222232131211 |
5 | 4022232243401 |
6 | 243200034553 |
7 | 33543556623 |
oct | 7352563545 |
9 | 2522586726 |
10 | 1001056101 |
11 | 4740852a1 |
12 | 23b302a59 |
13 | 12c519ab6 |
14 | 96d44513 |
15 | 5cd3e336 |
hex | 3baae765 |
1001056101 has 16 divisors (see below), whose sum is σ = 1416916800. Its totient is φ = 626486528.
The previous prime is 1001056099. The next prime is 1001056129. The reversal of 1001056101 is 1016501001.
It is a cyclic number.
It is not a de Polignac number, because 1001056101 - 21 = 1001056099 is a prime.
It is a super-2 number, since 2×10010561012 = 2004226634698644402, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001056151) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 5391 + ... + 45068.
It is an arithmetic number, because the mean of its divisors is an integer number (88557300).
Almost surely, 21001056101 is an apocalyptic number.
It is an amenable number.
1001056101 is a deficient number, since it is larger than the sum of its proper divisors (415860699).
1001056101 is a wasteful number, since it uses less digits than its factorization.
1001056101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50868.
The product of its (nonzero) digits is 30, while the sum is 15.
The square root of 1001056101 is about 31639.4706182009. The cubic root of 1001056101 is about 1000.3519098116.
Adding to 1001056101 its reverse (1016501001), we get a palindrome (2017557102).
Subtracting 1001056101 from its reverse (1016501001), we obtain a square (15444900 = 39302).
The spelling of 1001056101 in words is "one billion, one million, fifty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •