Base | Representation |
---|---|
bin | 1000101001001001… |
… | …1111011001100101 |
3 | 12222200200110000020 |
4 | 2022102133121211 |
5 | 14222421244023 |
6 | 1022115505353 |
7 | 111331356504 |
oct | 21222373145 |
9 | 5880613006 |
10 | 2320103013 |
11 | a90701808 |
12 | 548bb8259 |
13 | 2ac893427 |
14 | 1801c283b |
15 | d8a42de3 |
hex | 8a49f665 |
2320103013 has 8 divisors (see below), whose sum is σ = 3093708288. Its totient is φ = 1546616544.
The previous prime is 2320103003. The next prime is 2320103021. The reversal of 2320103013 is 3103010232.
2320103013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2320103013 - 218 = 2319840869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2320102983 and 2320103001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2320103003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37756 + ... + 77882.
It is an arithmetic number, because the mean of its divisors is an integer number (386713536).
Almost surely, 22320103013 is an apocalyptic number.
It is an amenable number.
2320103013 is a deficient number, since it is larger than the sum of its proper divisors (773605275).
2320103013 is a wasteful number, since it uses less digits than its factorization.
2320103013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59403.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 2320103013 is about 48167.4476488012. The cubic root of 2320103013 is about 1323.8407828199.
Adding to 2320103013 its reverse (3103010232), we get a palindrome (5423113245).
The spelling of 2320103013 in words is "two billion, three hundred twenty million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •