Base | Representation |
---|---|
bin | 111011111010000… |
… | …0000010001100001 |
3 | 12012002101202001112 |
4 | 1313310000101201 |
5 | 13104042340223 |
6 | 531243513105 |
7 | 100545514664 |
oct | 16764002141 |
9 | 5162352045 |
10 | 2010121313 |
11 | 94172a992 |
12 | 481228795 |
13 | 2605ac1c5 |
14 | 150d716db |
15 | bb711778 |
hex | 77d00461 |
2010121313 has 8 divisors (see below), whose sum is σ = 2076412416. Its totient is φ = 1943920800.
The previous prime is 2010121279. The next prime is 2010121319. The reversal of 2010121313 is 3131210102.
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 2010121313 - 26 = 2010121249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2010121319) 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, 24020 + ... + 67802.
It is an arithmetic number, because the mean of its divisors is an integer number (259551552).
Almost surely, 22010121313 is an apocalyptic number.
It is an amenable number.
2010121313 is a deficient number, since it is larger than the sum of its proper divisors (66291103).
2010121313 is a wasteful number, since it uses less digits than its factorization.
2010121313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45295.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 2010121313 is about 44834.3764649404. The cubic root of 2010121313 is about 1262.0428172814.
Adding to 2010121313 its reverse (3131210102), we get a palindrome (5141331415).
It can be divided in two parts, 20101 and 21313, that added together give a palindrome (41414).
The spelling of 2010121313 in words is "two billion, ten million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •