Base | Representation |
---|---|
bin | 111110100111011… |
… | …0000100110101111 |
3 | 12102102102221010102 |
4 | 1331032300212233 |
5 | 13300330133403 |
6 | 544252101315 |
7 | 103031245646 |
oct | 17516604657 |
9 | 5372387112 |
10 | 2101021103 |
11 | 988a76285 |
12 | 4a776483b |
13 | 27638786c |
14 | 15d07435d |
15 | c46b9b88 |
hex | 7d3b09af |
2101021103 has 8 divisors (see below), whose sum is σ = 2130624576. Its totient is φ = 2071440000.
The previous prime is 2101021073. The next prime is 2101021127. The reversal of 2101021103 is 3011201012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2101021103 - 228 = 1832585647 is a prime.
It is a super-3 number, since 3×21010211033 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101021133) 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 7 ways as a sum of consecutive naturals, for example, 296603 + ... + 303603.
It is an arithmetic number, because the mean of its divisors is an integer number (266328072).
Almost surely, 22101021103 is an apocalyptic number.
2101021103 is a deficient number, since it is larger than the sum of its proper divisors (29603473).
2101021103 is an equidigital number, since it uses as much as digits as its factorization.
2101021103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11185.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 2101021103 is about 45836.8967426897. The cubic root of 2101021103 is about 1280.7866874237.
Adding to 2101021103 its reverse (3011201012), we get a palindrome (5112222115).
The spelling of 2101021103 in words is "two billion, one hundred one million, twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •