Base | Representation |
---|---|
bin | 1010011011100110… |
… | …1010100010101001 |
3 | 21020010221120011021 |
4 | 2212321222202221 |
5 | 21213313244223 |
6 | 1141504332441 |
7 | 126250514614 |
oct | 24671524251 |
9 | 7203846137 |
10 | 2800134313 |
11 | 120766a399 |
12 | 661914121 |
13 | 358176412 |
14 | 1c7c5b17b |
15 | 115c6465d |
hex | a6e6a8a9 |
2800134313 has 4 divisors (see below), whose sum is σ = 2800309120. Its totient is φ = 2799959508.
The previous prime is 2800134307. The next prime is 2800134331. The reversal of 2800134313 is 3134310082.
2800134313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 a cyclic number.
It is not a de Polignac number, because 2800134313 - 221 = 2798037161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2800134713) 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, 60645 + ... + 96322.
It is an arithmetic number, because the mean of its divisors is an integer number (700077280).
Almost surely, 22800134313 is an apocalyptic number.
It is an amenable number.
2800134313 is a deficient number, since it is larger than the sum of its proper divisors (174807).
2800134313 is a wasteful number, since it uses less digits than its factorization.
2800134313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174806.
The product of its (nonzero) digits is 1728, while the sum is 25.
The square root of 2800134313 is about 52916.2953446290. The cubic root of 2800134313 is about 1409.4822828106.
Adding to 2800134313 its reverse (3134310082), we get a palindrome (5934444395).
The spelling of 2800134313 in words is "two billion, eight hundred million, one hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •