Base | Representation |
---|---|
bin | 111101011001001… |
… | …001000101110101 |
3 | 2122210010110202200 |
4 | 331121021011311 |
5 | 4102140013023 |
6 | 250112255113 |
7 | 34344602256 |
oct | 7531110565 |
9 | 2583113680 |
10 | 1030001013 |
11 | 489455008 |
12 | 248b41499 |
13 | 135512772 |
14 | 9ab1ab2d |
15 | 6065a743 |
hex | 3d649175 |
1030001013 has 12 divisors (see below), whose sum is σ = 1488073548. Its totient is φ = 686531520.
The previous prime is 1030001003. The next prime is 1030001041. The reversal of 1030001013 is 3101000301.
It can be written as a sum of positive squares in 2 ways, for example, as 655462404 + 374538609 = 25602^2 + 19353^2 .
It is not a de Polignac number, because 1030001013 - 24 = 1030000997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1030000986 and 1030001004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030001003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 61081 + ... + 76097.
It is an arithmetic number, because the mean of its divisors is an integer number (124006129).
Almost surely, 21030001013 is an apocalyptic number.
It is an amenable number.
1030001013 is a deficient number, since it is larger than the sum of its proper divisors (458072535).
1030001013 is a wasteful number, since it uses less digits than its factorization.
1030001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22644 (or 22641 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
The square root of 1030001013 is about 32093.6288537149. The cubic root of 1030001013 is about 1009.9019651276.
Adding to 1030001013 its reverse (3101000301), we get a palindrome (4131001314).
The spelling of 1030001013 in words is "one billion, thirty million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •