Base | Representation |
---|---|
bin | 111101011010010… |
… | …101000010110001 |
3 | 2122210201021111220 |
4 | 331122111002301 |
5 | 4102224441423 |
6 | 250123055253 |
7 | 34350336255 |
oct | 7532250261 |
9 | 2583637456 |
10 | 1030312113 |
11 | 489647816 |
12 | 249071529 |
13 | 1355c124c |
14 | 9ab9c265 |
15 | 606bc9e3 |
hex | 3d6950b1 |
1030312113 has 8 divisors (see below), whose sum is σ = 1373930976. Its totient is φ = 686784000.
The previous prime is 1030312111. The next prime is 1030312139. The reversal of 1030312113 is 3112130301.
1030312113 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 1030312113 - 21 = 1030312111 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1030312092 and 1030312101.
It is not an unprimeable number, because it can be changed into a prime (1030312111) 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, 10918 + ... + 46688.
It is an arithmetic number, because the mean of its divisors is an integer number (171741372).
Almost surely, 21030312113 is an apocalyptic number.
It is an amenable number.
1030312113 is a deficient number, since it is larger than the sum of its proper divisors (343618863).
1030312113 is an equidigital number, since it uses as much as digits as its factorization.
1030312113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45375.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 1030312113 is about 32098.4752441607. The cubic root of 1030312113 is about 1010.0036313303.
Adding to 1030312113 its reverse (3112130301), we get a palindrome (4142442414).
The spelling of 1030312113 in words is "one billion, thirty million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •