Base | Representation |
---|---|
bin | 11101010011000011111… |
… | …100000101000110111001 |
3 | 21010110202120100200110122 |
4 | 131103003330011012321 |
5 | 230441300443014314 |
6 | 4140524552023025 |
7 | 265313146434164 |
oct | 35230374050671 |
9 | 7113676320418 |
10 | 2013332001209 |
11 | 706938477701 |
12 | 286244991a75 |
13 | 117b19659999 |
14 | 6d63535cadb |
15 | 3758866028e |
hex | 1d4c3f051b9 |
2013332001209 has 8 divisors (see below), whose sum is σ = 2093329620360. Its totient is φ = 1934039207296.
The previous prime is 2013332001113. The next prime is 2013332001227. The reversal of 2013332001209 is 9021002333102.
It can be written as a sum of positive squares in 4 ways, for example, as 653316558400 + 1360015442809 = 808280^2 + 1166197^2 .
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 2013332001209 - 212 = 2013331997113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2013332001809) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 176200484 + ... + 176211909.
It is an arithmetic number, because the mean of its divisors is an integer number (261666202545).
Almost surely, 22013332001209 is an apocalyptic number.
2013332001209 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
It is an amenable number.
2013332001209 is a deficient number, since it is larger than the sum of its proper divisors (79997619151).
2013332001209 is a wasteful number, since it uses less digits than its factorization.
2013332001209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352412619.
The product of its (nonzero) digits is 1944, while the sum is 26.
The spelling of 2013332001209 in words is "two trillion, thirteen billion, three hundred thirty-two million, one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.015 sec. • engine limits •