Base | Representation |
---|---|
bin | 11101001111111101011… |
… | …001110010000000101000 |
3 | 21010011011102201110020211 |
4 | 131033331121302000220 |
5 | 230412440241340240 |
6 | 4135214243430504 |
7 | 265134462430123 |
oct | 35177531620050 |
9 | 7104142643224 |
10 | 2010001121320 |
11 | 705489261305 |
12 | 285675385434 |
13 | 11770855503a |
14 | 6d3dac253ba |
15 | 3744100cbea |
hex | 1d3fd672028 |
2010001121320 has 32 divisors (see below), whose sum is σ = 4523087446920. Its totient is φ = 803896462080.
The previous prime is 2010001121299. The next prime is 2010001121329. The reversal of 2010001121320 is 231211000102.
It can be written as a sum of positive squares in 4 ways, for example, as 625298214564 + 1384702906756 = 790758^2 + 1176734^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 2010001121320.
It is not an unprimeable number, because it can be changed into a prime (2010001121329) 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, 2936067 + ... + 3555346.
Almost surely, 22010001121320 is an apocalyptic number.
2010001121320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2010001121320 is an abundant number, since it is smaller than the sum of its proper divisors (2513086325600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010001121320 is a wasteful number, since it uses less digits than its factorization.
2010001121320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6499165 (or 6499161 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 2010001121320 its reverse (231211000102), we get a palindrome (2241212121422).
The spelling of 2010001121320 in words is "two trillion, ten billion, one million, one hundred twenty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •