Base | Representation |
---|---|
bin | 111110101000000… |
… | …0100101111010001 |
3 | 12102110002102211202 |
4 | 1331100010233101 |
5 | 13300422200323 |
6 | 544303320545 |
7 | 103034212436 |
oct | 17520045721 |
9 | 5373072752 |
10 | 2101365713 |
11 | 989191187 |
12 | 4a78b0155 |
13 | 276478685 |
14 | 15d123b8d |
15 | c4736d28 |
hex | 7d404bd1 |
2101365713 has 4 divisors (see below), whose sum is σ = 2101467060. Its totient is φ = 2101264368.
The previous prime is 2101365703. The next prime is 2101365719. The reversal of 2101365713 is 3175631012.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 1199444689 + 901921024 = 34633^2 + 30032^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101365713 - 26 = 2101365649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2101365719) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7058 + ... + 65211.
It is an arithmetic number, because the mean of its divisors is an integer number (525366765).
Almost surely, 22101365713 is an apocalyptic number.
It is an amenable number.
2101365713 is a deficient number, since it is larger than the sum of its proper divisors (101347).
2101365713 is an equidigital number, since it uses as much as digits as its factorization.
2101365713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101346.
The product of its (nonzero) digits is 3780, while the sum is 29.
The square root of 2101365713 is about 45840.6556781205. The cubic root of 2101365713 is about 1280.8567085785.
Adding to 2101365713 its reverse (3175631012), we get a palindrome (5276996725).
The spelling of 2101365713 in words is "two billion, one hundred one million, three hundred sixty-five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •