Base | Representation |
---|---|
bin | 111100001101001… |
… | …110101101101100 |
3 | 2121101200110012212 |
4 | 330031032231230 |
5 | 4032041213400 |
6 | 244121545552 |
7 | 34013501111 |
oct | 7415165554 |
9 | 2541613185 |
10 | 1010101100 |
11 | 4791a29a8 |
12 | 2423452b8 |
13 | 131365a78 |
14 | 9821a908 |
15 | 5da29335 |
hex | 3c34eb6c |
1010101100 has 36 divisors (see below), whose sum is σ = 2196088608. Its totient is φ = 403272000.
The previous prime is 1010101093. The next prime is 1010101109. The reversal of 1010101100 is 11010101.
It is a Harshad number since it is a multiple of its sum of digits (5).
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 11 ways as a sum of consecutive naturals, for example, 44765 + ... + 63435.
Almost surely, 21010101100 is an apocalyptic number.
1010101100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010101100 is an abundant number, since it is smaller than the sum of its proper divisors (1185987508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010101100 is a wasteful number, since it uses less digits than its factorization.
1010101100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19226 (or 19219 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
The square root of 1010101100 is about 31782.0877224892. The cubic root of 1010101100 is about 1003.3557596142.
Adding to 1010101100 its reverse (11010101), we get a palindrome (1021111201).
Subtracting from 1010101100 its reverse (11010101), we obtain a palindrome (999090999).
The spelling of 1010101100 in words is "one billion, ten million, one hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •