Base | Representation |
---|---|
bin | 111100000000001… |
… | …0000011001101111 |
3 | 12012022102220210201 |
4 | 1320000100121233 |
5 | 13110403124403 |
6 | 531440414331 |
7 | 100615022545 |
oct | 17000203157 |
9 | 5168386721 |
10 | 2013333103 |
11 | 943523a61 |
12 | 4823173a7 |
13 | 261165082 |
14 | 151569d95 |
15 | bbb4821d |
hex | 7801066f |
2013333103 has 8 divisors (see below), whose sum is σ = 2135406672. Its totient is φ = 1891664256.
The previous prime is 2013333089. The next prime is 2013333107. The reversal of 2013333103 is 3013333102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2013333103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013333107) 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, 90900 + ... + 110857.
It is an arithmetic number, because the mean of its divisors is an integer number (266925834).
Almost surely, 22013333103 is an apocalyptic number.
2013333103 is a deficient number, since it is larger than the sum of its proper divisors (122073569).
2013333103 is a wasteful number, since it uses less digits than its factorization.
2013333103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202361.
The product of its (nonzero) digits is 486, while the sum is 19.
The square root of 2013333103 is about 44870.1805545732. The cubic root of 2013333103 is about 1262.7146274066.
Adding to 2013333103 its reverse (3013333102), we get a palindrome (5026666205).
Subtracting 2013333103 from its reverse (3013333102), we obtain a palindrome (999999999).
The spelling of 2013333103 in words is "two billion, thirteen million, three hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •