Base | Representation |
---|---|
bin | 11101011001010001110… |
… | …00110101101001100101 |
3 | 10120112222212101212111020 |
4 | 32230220320311221211 |
5 | 113021441321144023 |
6 | 2051553352001353 |
7 | 132653552265525 |
oct | 16545070655145 |
9 | 3515885355436 |
10 | 1010003303013 |
11 | 35a381596571 |
12 | 1438b4090259 |
13 | 74320871553 |
14 | 36c54bc9685 |
15 | 1b414a77de3 |
hex | eb28e35a65 |
1010003303013 has 12 divisors (see below), whose sum is σ = 1375933284960. Its totient is φ = 659009243032.
The previous prime is 1010003302993. The next prime is 1010003303083. The reversal of 1010003303013 is 3103033000101.
It is not a de Polignac number, because 1010003303013 - 217 = 1010003171941 is a prime.
It is a super-3 number, since 3×10100033030133 (a number of 37 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1010003302983 and 1010003303001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010003303083) 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, 76197033 + ... + 76210286.
It is an arithmetic number, because the mean of its divisors is an integer number (114661107080).
Almost surely, 21010003303013 is an apocalyptic number.
It is an amenable number.
1010003303013 is a deficient number, since it is larger than the sum of its proper divisors (365929981947).
1010003303013 is an equidigital number, since it uses as much as digits as its factorization.
1010003303013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152407416 (or 152407369 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 1010003303013 its reverse (3103033000101), we get a palindrome (4113036303114).
The spelling of 1010003303013 in words is "one trillion, ten billion, three million, three hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •