Base | Representation |
---|---|
bin | 101111000010010101… |
… | …0111101101011100011 |
3 | 100122201120022220002100 |
4 | 1132010222331223203 |
5 | 3123332041244021 |
6 | 114223045021443 |
7 | 10204060465146 |
oct | 1360452755343 |
9 | 318646286070 |
10 | 101010103011 |
11 | 3992462a484 |
12 | 176b00b4883 |
13 | 96a9b7632c |
14 | 4c6327c05d |
15 | 2962c64626 |
hex | 1784abdae3 |
101010103011 has 6 divisors (see below), whose sum is σ = 145903482140. Its totient is φ = 67340068668.
The previous prime is 101010102979. The next prime is 101010103027. The reversal of 101010103011 is 110301010101.
It is not a de Polignac number, because 101010103011 - 25 = 101010102979 is a prime.
It is a super-2 number, since 2×1010101030112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 11223344779 = 101010103011 / (1 + 0 + 1 + 0 + 1 + 0 + 1 + 0 + 3 + 0 + 1 + 1).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101010102984 and 101010103002.
It is not an unprimeable number, because it can be changed into a prime (101010103031) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5611672381 + ... + 5611672398.
Almost surely, 2101010103011 is an apocalyptic number.
101010103011 is a deficient number, since it is larger than the sum of its proper divisors (44893379129).
101010103011 is a wasteful number, since it uses less digits than its factorization.
101010103011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11223344785 (or 11223344782 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 101010103011 its reverse (110301010101), we get a palindrome (211311113112).
The spelling of 101010103011 in words is "one hundred one billion, ten million, one hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •