Base | Representation |
---|---|
bin | 10110100011101111… |
… | …10011011000001101 |
3 | 1011021000222121020100 |
4 | 23101313303120031 |
5 | 144300404013401 |
6 | 5321432441313 |
7 | 606056545053 |
oct | 132167633015 |
9 | 34230877210 |
10 | 12111001101 |
11 | 5155387421 |
12 | 241bb49239 |
13 | 11b015a754 |
14 | 82c6741d3 |
15 | 4ad399b86 |
hex | 2d1df360d |
12111001101 has 24 divisors (see below), whose sum is σ = 17566465280. Its totient is φ = 8040469536.
The previous prime is 12111001099. The next prime is 12111001103. The reversal of 12111001101 is 10110011121.
It is an interprime number because it is at equal distance from previous prime (12111001099) and next prime (12111001103).
It is not a de Polignac number, because 12111001101 - 21 = 12111001099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12111001103) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 2735976 + ... + 2740398.
Almost surely, 212111001101 is an apocalyptic number.
It is an amenable number.
12111001101 is a deficient number, since it is larger than the sum of its proper divisors (5455464179).
12111001101 is a wasteful number, since it uses less digits than its factorization.
12111001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5625 (or 5622 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 12111001101 its reverse (10110011121), we get a palindrome (22221012222).
It can be divided in two parts, 1211100 and 1101, that added together give a square (1212201 = 11012).
The spelling of 12111001101 in words is "twelve billion, one hundred eleven million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •