Base | Representation |
---|---|
bin | 111100110011000… |
… | …000001011000101 |
3 | 2122002022112002101 |
4 | 330303000023011 |
5 | 4042110044023 |
6 | 245114112101 |
7 | 34163611501 |
oct | 7463001305 |
9 | 2562275071 |
10 | 1020003013 |
11 | 4838463a7 |
12 | 24571b631 |
13 | 133421aa3 |
14 | 99677301 |
15 | 5e8331ad |
hex | 3ccc02c5 |
1020003013 has 8 divisors (see below), whose sum is σ = 1081364480. Its totient is φ = 960420240.
The previous prime is 1020002999. The next prime is 1020003029. The reversal of 1020003013 is 3103000201.
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 1020003013 - 213 = 1019994821 is a prime.
It is a super-2 number, since 2×10200030132 = 2080812293058156338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020003053) 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, 443493 + ... + 445786.
It is an arithmetic number, because the mean of its divisors is an integer number (135170560).
Almost surely, 21020003013 is an apocalyptic number.
It is an amenable number.
1020003013 is a deficient number, since it is larger than the sum of its proper divisors (61361467).
1020003013 is an equidigital number, since it uses as much as digits as its factorization.
1020003013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 889347.
The product of its (nonzero) digits is 18, while the sum is 10.
The square root of 1020003013 is about 31937.4860156525. The cubic root of 1020003013 is about 1006.6237007206.
Adding to 1020003013 its reverse (3103000201), we get a palindrome (4123003214).
The spelling of 1020003013 in words is "one billion, twenty million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •