Base | Representation |
---|---|
bin | 100110011001… |
… | …0110100011101 |
3 | 1101212202200100 |
4 | 1030302310131 |
5 | 20123143401 |
6 | 1555251313 |
7 | 333053154 |
oct | 114626435 |
9 | 41782610 |
10 | 20131101 |
11 | 103aa881 |
12 | 68a9b39 |
13 | 422acc3 |
14 | 296059b |
15 | 1b79b86 |
hex | 1332d1d |
20131101 has 12 divisors (see below), whose sum is σ = 29346460. Its totient is φ = 13296960.
The previous prime is 20131093. The next prime is 20131103. The reversal of 20131101 is 10113102.
It can be written as a sum of positive squares in 2 ways, for example, as 13505625 + 6625476 = 3675^2 + 2574^2 .
It is not a de Polignac number, because 20131101 - 23 = 20131093 is a prime.
It is a super-2 number, since 2×201311012 = 810522454944402, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20131103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9280 + ... + 11241.
Almost surely, 220131101 is an apocalyptic number.
It is an amenable number.
20131101 is a deficient number, since it is larger than the sum of its proper divisors (9215359).
20131101 is a wasteful number, since it uses less digits than its factorization.
20131101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20636 (or 20633 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 20131101 is about 4486.7695505787. The cubic root of 20131101 is about 272.0335751878.
Adding to 20131101 its reverse (10113102), we get a palindrome (30244203).
The spelling of 20131101 in words is "twenty million, one hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.018 sec. • engine limits •