Base | Representation |
---|---|
bin | 111100001101001… |
… | …110011110000101 |
3 | 2121101200101211212 |
4 | 330031032132011 |
5 | 4032041200401 |
6 | 244121541205 |
7 | 34013465153 |
oct | 7415163605 |
9 | 2541611755 |
10 | 1010100101 |
11 | 4791a217a |
12 | 242344805 |
13 | 13136548a |
14 | 9821a3d3 |
15 | 5da28dbb |
hex | 3c34e785 |
1010100101 has 4 divisors (see below), whose sum is σ = 1069517772. Its totient is φ = 950682432.
The previous prime is 1010100061. The next prime is 1010100103. The reversal of 1010100101 is 1010010101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 463756225 + 546343876 = 21535^2 + 23374^2 .
It is a de Polignac number, because none of the positive numbers 2k-1010100101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010100103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29708810 + ... + 29708843.
It is an arithmetic number, because the mean of its divisors is an integer number (267379443).
Almost surely, 21010100101 is an apocalyptic number.
It is an amenable number.
1010100101 is a deficient number, since it is larger than the sum of its proper divisors (59417671).
1010100101 is an equidigital number, since it uses as much as digits as its factorization.
1010100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59417670.
The product of its (nonzero) digits is 1, while the sum is 5.
The square root of 1010100101 is about 31782.0720060854. The cubic root of 1010100101 is about 1003.3554288378.
Adding to 1010100101 its reverse (1010010101), we get a palindrome (2020110202).
Subtracting from 1010100101 its reverse (1010010101), we obtain a square (90000 = 3002).
The spelling of 1010100101 in words is "one billion, ten million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •