Base | Representation |
---|---|
bin | 111101011001001… |
… | …000110111110001 |
3 | 2122210010102112100 |
4 | 331121020313301 |
5 | 4102140000423 |
6 | 250112251013 |
7 | 34344566532 |
oct | 7531106761 |
9 | 2583112470 |
10 | 1030000113 |
11 | 48945436a |
12 | 248b40a69 |
13 | 13551222c |
14 | 9ab1a689 |
15 | 6065a343 |
hex | 3d648df1 |
1030000113 has 24 divisors (see below), whose sum is σ = 1533568608. Its totient is φ = 665767872.
The previous prime is 1030000091. The next prime is 1030000123. The reversal of 1030000113 is 3110000301.
It is not a de Polignac number, because 1030000113 - 28 = 1029999857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1030000095 and 1030000104.
It is not an unprimeable number, because it can be changed into a prime (1030000123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43306 + ... + 62732.
It is an arithmetic number, because the mean of its divisors is an integer number (63898692).
Almost surely, 21030000113 is an apocalyptic number.
It is an amenable number.
1030000113 is a deficient number, since it is larger than the sum of its proper divisors (503568495).
1030000113 is a wasteful number, since it uses less digits than its factorization.
1030000113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19613 (or 19610 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
The square root of 1030000113 is about 32093.6148322373. The cubic root of 1030000113 is about 1009.9016709816.
Adding to 1030000113 its reverse (3110000301), we get a palindrome (4140000414).
The spelling of 1030000113 in words is "one billion, thirty million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •