Base | Representation |
---|---|
bin | 111100001101001… |
… | …110101101110001 |
3 | 2121101200110020001 |
4 | 330031032231301 |
5 | 4032041213410 |
6 | 244121550001 |
7 | 34013501116 |
oct | 7415165561 |
9 | 2541613201 |
10 | 1010101105 |
11 | 4791a2a02 |
12 | 242345301 |
13 | 131365a80 |
14 | 9821a90d |
15 | 5da2933a |
hex | 3c34eb71 |
1010101105 has 16 divisors (see below), whose sum is σ = 1313689104. Its totient is φ = 741162240.
The previous prime is 1010101093. The next prime is 1010101109. The reversal of 1010101105 is 5011010101.
It can be written as a sum of positive squares in 8 ways, for example, as 353101681 + 656999424 = 18791^2 + 25632^2 .
It is not a de Polignac number, because 1010101105 - 229 = 473230193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010101091 and 1010101100.
It is not an unprimeable number, because it can be changed into a prime (1010101109) 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 15 ways as a sum of consecutive naturals, for example, 39286 + ... + 59695.
It is an arithmetic number, because the mean of its divisors is an integer number (82105569).
Almost surely, 21010101105 is an apocalyptic number.
It is an amenable number.
1010101105 is a deficient number, since it is larger than the sum of its proper divisors (303587999).
1010101105 is a wasteful number, since it uses less digits than its factorization.
1010101105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99156.
The product of its (nonzero) digits is 5, while the sum is 10.
The square root of 1010101105 is about 31782.0878011499. The cubic root of 1010101105 is about 1003.3557612697.
Adding to 1010101105 its reverse (5011010101), we get a palindrome (6021111206).
The spelling of 1010101105 in words is "one billion, ten million, one hundred one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •