Base | Representation |
---|---|
bin | 1000011011100010… |
… | …1100110000001001 |
3 | 12211201020211112210 |
4 | 2012320230300021 |
5 | 14113312312223 |
6 | 1012320055333 |
7 | 110036161464 |
oct | 20670546011 |
9 | 5751224483 |
10 | 2263010313 |
11 | a61457163 |
12 | 531a64549 |
13 | 2a0ac3875 |
14 | 1767a02db |
15 | d3a16893 |
hex | 86e2cc09 |
2263010313 has 8 divisors (see below), whose sum is σ = 3068488800. Its totient is φ = 1483102688.
The previous prime is 2263010311. The next prime is 2263010329. The reversal of 2263010313 is 3130103622.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2263010313 - 21 = 2263010311 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2263010313.
It is not an unprimeable number, because it can be changed into a prime (2263010311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6392508 + ... + 6392861.
It is an arithmetic number, because the mean of its divisors is an integer number (383561100).
Almost surely, 22263010313 is an apocalyptic number.
It is an amenable number.
2263010313 is a deficient number, since it is larger than the sum of its proper divisors (805478487).
2263010313 is a wasteful number, since it uses less digits than its factorization.
2263010313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12785431.
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 2263010313 is about 47571.1079648141. The cubic root of 2263010313 is about 1312.8915235039.
Adding to 2263010313 its reverse (3130103622), we get a palindrome (5393113935).
The spelling of 2263010313 in words is "two billion, two hundred sixty-three million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •