Base | Representation |
---|---|
bin | 111110101011001… |
… | …0110011011000101 |
3 | 12102120012000202210 |
4 | 1331112112123011 |
5 | 13301332323023 |
6 | 544402454033 |
7 | 103054204305 |
oct | 17526263305 |
9 | 5376160683 |
10 | 2103011013 |
11 | 98a105334 |
12 | 4a8364319 |
13 | 27690351c |
14 | 15d431605 |
15 | c495e593 |
hex | 7d5966c5 |
2103011013 has 4 divisors (see below), whose sum is σ = 2804014688. Its totient is φ = 1402007340.
The previous prime is 2103010999. The next prime is 2103011023. The reversal of 2103011013 is 3101103012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2103011013 - 25 = 2103010981 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2103011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2103011023) 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, 350501833 + ... + 350501838.
It is an arithmetic number, because the mean of its divisors is an integer number (701003672).
Almost surely, 22103011013 is an apocalyptic number.
It is an amenable number.
2103011013 is a deficient number, since it is larger than the sum of its proper divisors (701003675).
2103011013 is an equidigital number, since it uses as much as digits as its factorization.
2103011013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 701003674.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 2103011013 is about 45858.5980269785. The cubic root of 2103011013 is about 1281.1909108803.
Adding to 2103011013 its reverse (3101103012), we get a palindrome (5204114025).
The spelling of 2103011013 in words is "two billion, one hundred three million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •