Base | Representation |
---|---|
bin | 100000101001010101110… |
… | …110001101000001101000 |
3 | 21221110122022201122111211 |
4 | 200221111312031001220 |
5 | 243224002234413000 |
6 | 4434335414402504 |
7 | 321036604401136 |
oct | 40512566150150 |
9 | 7843568648454 |
10 | 2243413201000 |
11 | 7954762a24a4 |
12 | 302956660434 |
13 | 133725b0145a |
14 | 7a820584756 |
15 | 3d5528ec7ba |
hex | 20a55d8d068 |
2243413201000 has 96 divisors (see below), whose sum is σ = 5540423620680. Its totient is φ = 850135392000.
The previous prime is 2243413200997. The next prime is 2243413201009. The reversal of 2243413201000 is 1023143422.
It can be written as a sum of positive squares in 4 ways, for example, as 160142431684 + 2083270769316 = 400178^2 + 1443354^2 .
It is not an unprimeable number, because it can be changed into a prime (2243413201009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2746221 + ... + 3468220.
Almost surely, 22243413201000 is an apocalyptic number.
2243413201000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2243413201000 is an abundant number, since it is smaller than the sum of its proper divisors (3297010419680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2243413201000 is a wasteful number, since it uses less digits than its factorization.
2243413201000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6214500 (or 6214467 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 2243413201000 its reverse (1023143422), we get a palindrome (2244436344422).
The spelling of 2243413201000 in words is "two trillion, two hundred forty-three billion, four hundred thirteen million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •