Base | Representation |
---|---|
bin | 110011010001010011… |
… | …0100100001010110011 |
3 | 101112012012201022210201 |
4 | 1212202212210022303 |
5 | 3300442130413021 |
6 | 122325200140031 |
7 | 10645302160405 |
oct | 1464246441263 |
9 | 345165638721 |
10 | 110102201011 |
11 | 4276a905260 |
12 | 19409007617 |
13 | a4c873148a |
14 | 54869c8b75 |
15 | 2ce6084591 |
hex | 19a29a42b3 |
110102201011 has 16 divisors (see below), whose sum is σ = 121925029248. Its totient is φ = 98582140800.
The previous prime is 110102200973. The next prime is 110102201023.
110102201011 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-110102201011 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110102201051) 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, 6691851 + ... + 6708283.
It is an arithmetic number, because the mean of its divisors is an integer number (7620314328).
Almost surely, 2110102201011 is an apocalyptic number.
110102201011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110102201011 is a deficient number, since it is larger than the sum of its proper divisors (11822828237).
110102201011 is a wasteful number, since it uses less digits than its factorization.
110102201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25602.
The product of its (nonzero) digits is 4, while the sum is 10.
It can be divided in two parts, 110102 and 201011, that multiplied together give a palindrome (22131713122).
The spelling of 110102201011 in words is "one hundred ten billion, one hundred two million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •