Base | Representation |
---|---|
bin | 1100000010111… |
… | …10100101010101 |
3 | 21001010220111212 |
4 | 12001132211111 |
5 | 201332110314 |
6 | 14005511205 |
7 | 2334626324 |
oct | 601364525 |
9 | 231126455 |
10 | 101050709 |
11 | 52049991 |
12 | 29a12505 |
13 | 17c20b26 |
14 | d5c60bb |
15 | 8d10e3e |
hex | 605e955 |
101050709 has 8 divisors (see below), whose sum is σ = 103347552. Its totient is φ = 98774640.
The previous prime is 101050699. The next prime is 101050711. The reversal of 101050709 is 907050101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101050709 is a prime.
It is a super-2 number, since 2×1010507092 = 20422491578805362, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101050769) 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 7 ways as a sum of consecutive naturals, for example, 4862 + ... + 15024.
It is an arithmetic number, because the mean of its divisors is an integer number (12918444).
Almost surely, 2101050709 is an apocalyptic number.
It is an amenable number.
101050709 is a deficient number, since it is larger than the sum of its proper divisors (2296843).
101050709 is a wasteful number, since it uses less digits than its factorization.
101050709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10387.
The product of its (nonzero) digits is 315, while the sum is 23.
The square root of 101050709 is about 10052.3981715807. The cubic root of 101050709 is about 465.7788757918.
The spelling of 101050709 in words is "one hundred one million, fifty thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •