Base | Representation |
---|---|
bin | 101111000101000000… |
… | …1111001011011110010 |
3 | 100122221211111011221212 |
4 | 1132022001321123302 |
5 | 3124023100013020 |
6 | 114240015520122 |
7 | 10206231554351 |
oct | 1361201713362 |
9 | 318854434855 |
10 | 101100001010 |
11 | 39970351148 |
12 | 17716229042 |
13 | 96c2690a08 |
14 | 4c7119d998 |
15 | 296aac0cc5 |
hex | 178a0796f2 |
101100001010 has 8 divisors (see below), whose sum is σ = 181980001836. Its totient is φ = 40440000400.
The previous prime is 101100000961. The next prime is 101100001027. The reversal of 101100001010 is 10100001101.
It can be written as a sum of positive squares in 2 ways, for example, as 98631799249 + 2468201761 = 314057^2 + 49681^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a junction number, because it is equal to n+sod(n) for n = 101100000985 and 101100001003.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5055000041 + ... + 5055000060.
Almost surely, 2101100001010 is an apocalyptic number.
101100001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101100001010 is a deficient number, since it is larger than the sum of its proper divisors (80880000826).
101100001010 is a wasteful number, since it uses less digits than its factorization.
101100001010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10110000108.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 101100001010 its reverse (10100001101), we get a palindrome (111200002111).
Subtracting from 101100001010 its reverse (10100001101), we obtain a palindrome (90999999909).
The spelling of 101100001010 in words is "one hundred one billion, one hundred million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •