Base | Representation |
---|---|
bin | 111011111111101… |
… | …0111110100001001 |
3 | 12012022000010212012 |
4 | 1313333113310021 |
5 | 13110323220241 |
6 | 531431425305 |
7 | 100613036030 |
oct | 16777276411 |
9 | 5168003765 |
10 | 2013101321 |
11 | 943385900 |
12 | 482225235 |
13 | 2610b371a |
14 | 151509717 |
15 | bbaee6eb |
hex | 77fd7d09 |
2013101321 has 48 divisors (see below), whose sum is σ = 2628165120. Its totient is φ = 1508284800.
The previous prime is 2013101309. The next prime is 2013101351. The reversal of 2013101321 is 1231013102.
It is a de Polignac number, because none of the positive numbers 2k-2013101321 is a prime.
It is a super-2 number, since 2×20131013212 = 8105153857223890082, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2013101296 and 2013101305.
It is not an unprimeable number, because it can be changed into a prime (2013101351) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2427935 + ... + 2428763.
It is an arithmetic number, because the mean of its divisors is an integer number (54753440).
Almost surely, 22013101321 is an apocalyptic number.
It is an amenable number.
2013101321 is a deficient number, since it is larger than the sum of its proper divisors (615063799).
2013101321 is a wasteful number, since it uses less digits than its factorization.
2013101321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 966 (or 955 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 2013101321 is about 44867.5976735996. The cubic root of 2013101321 is about 1262.6661694948. Note that the first 3 decimals are identical.
Adding to 2013101321 its reverse (1231013102), we get a palindrome (3244114423).
The spelling of 2013101321 in words is "two billion, thirteen million, one hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •