Base | Representation |
---|---|
bin | 111110110001001… |
… | …0010101001110111 |
3 | 12102210002001201110 |
4 | 1331202102221313 |
5 | 13303133010203 |
6 | 544553530103 |
7 | 103122622440 |
oct | 17542225167 |
9 | 5383061643 |
10 | 2106141303 |
11 | 990953152 |
12 | 4a9413933 |
13 | 27745b276 |
14 | 15da082c7 |
15 | c4d7bd03 |
hex | 7d892a77 |
2106141303 has 16 divisors (see below), whose sum is σ = 3348896256. Its totient is φ = 1151182560.
The previous prime is 2106141287. The next prime is 2106141307. The reversal of 2106141303 is 3031416012.
It is not a de Polignac number, because 2106141303 - 24 = 2106141287 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 2106141303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2106141307) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2179788 + ... + 2180753.
It is an arithmetic number, because the mean of its divisors is an integer number (209306016).
Almost surely, 22106141303 is an apocalyptic number.
2106141303 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2106141303 is a deficient number, since it is larger than the sum of its proper divisors (1242754953).
2106141303 is a wasteful number, since it uses less digits than its factorization.
2106141303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4360574.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 2106141303 is about 45892.7151408587. The cubic root of 2106141303 is about 1281.8262714603.
Adding to 2106141303 its reverse (3031416012), we get a palindrome (5137557315).
The spelling of 2106141303 in words is "two billion, one hundred six million, one hundred forty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •