Base | Representation |
---|---|
bin | 1010100111000101… |
… | …1110101100111001 |
3 | 21100111121122220221 |
4 | 2221301132230321 |
5 | 21313132222223 |
6 | 1150345220041 |
7 | 130404215566 |
oct | 25161365471 |
9 | 7314548827 |
10 | 2848320313 |
11 | 1231891233 |
12 | 675a91621 |
13 | 365147c47 |
14 | 1d040186d |
15 | 11a0d1b5d |
hex | a9c5eb39 |
2848320313 has 4 divisors (see below), whose sum is σ = 2870748160. Its totient is φ = 2825892468.
The previous prime is 2848320287. The next prime is 2848320323. The reversal of 2848320313 is 3130238482.
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 2848320313 - 217 = 2848189241 is a prime.
It is a super-2 number, since 2×28483203132 = 16225857210896835938, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2848320323) 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, 11213733 + ... + 11213986.
It is an arithmetic number, because the mean of its divisors is an integer number (717687040).
Almost surely, 22848320313 is an apocalyptic number.
It is an amenable number.
2848320313 is a deficient number, since it is larger than the sum of its proper divisors (22427847).
2848320313 is a wasteful number, since it uses less digits than its factorization.
2848320313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22427846.
The product of its (nonzero) digits is 27648, while the sum is 34.
The square root of 2848320313 is about 53369.6572314269. The cubic root of 2848320313 is about 1417.5213509325.
Adding to 2848320313 its reverse (3130238482), we get a palindrome (5978558795).
The spelling of 2848320313 in words is "two billion, eight hundred forty-eight million, three hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •