Base | Representation |
---|---|
bin | 111011111100010… |
… | …0111101000011101 |
3 | 12012011200012120111 |
4 | 1313320213220131 |
5 | 13104400043401 |
6 | 531325450021 |
7 | 100562014033 |
oct | 16770475035 |
9 | 5164605514 |
10 | 2011331101 |
11 | 94238690a |
12 | 481710911 |
13 | 260913a60 |
14 | 1511a8553 |
15 | bb89ee51 |
hex | 77e27a1d |
2011331101 has 16 divisors (see below), whose sum is σ = 2204858880. Its totient is φ = 1823440320.
The previous prime is 2011331053. The next prime is 2011331107. The reversal of 2011331101 is 1011331102.
It is not a de Polignac number, because 2011331101 - 29 = 2011330589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011331107) 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 15 ways as a sum of consecutive naturals, for example, 682890 + ... + 685828.
It is an arithmetic number, because the mean of its divisors is an integer number (137803680).
Almost surely, 22011331101 is an apocalyptic number.
It is an amenable number.
2011331101 is a deficient number, since it is larger than the sum of its proper divisors (193527779).
2011331101 is a wasteful number, since it uses less digits than its factorization.
2011331101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3876.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 2011331101 is about 44847.8661811239. The cubic root of 2011331101 is about 1262.2959525933.
Adding to 2011331101 its reverse (1011331102), we get a palindrome (3022662203).
Subtracting from 2011331101 its reverse (1011331102), we obtain a palindrome (999999999).
The spelling of 2011331101 in words is "two billion, eleven million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •