Base | Representation |
---|---|
bin | 100000000010001001100… |
… | …011011001000110100000 |
3 | 21210110000112122221200020 |
4 | 200002021203121012200 |
5 | 242031311214341000 |
6 | 4403135535153440 |
7 | 315020014604361 |
oct | 40021143310640 |
9 | 7713015587606 |
10 | 2201331012000 |
11 | 779640a70aaa |
12 | 2b6771375880 |
13 | 12c77a558cc3 |
14 | 7878b645b68 |
15 | 3c3dd21aba0 |
hex | 200898d91a0 |
2201331012000 has 192 divisors, whose sum is σ = 7525107442944. Its totient is φ = 561498854400.
The previous prime is 2201331011989. The next prime is 2201331012007. The reversal of 2201331012000 is 2101331022.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (2201331012007) 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 31 ways as a sum of consecutive naturals, for example, 3711919 + ... + 4263918.
It is an arithmetic number, because the mean of its divisors is an integer number (39193267932).
Almost surely, 22201331012000 is an apocalyptic number.
2201331012000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2201331012000 is an abundant number, since it is smaller than the sum of its proper divisors (5323776430944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201331012000 is a wasteful number, since it uses less digits than its factorization.
2201331012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7975888 (or 7975870 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2201331012000 its reverse (2101331022), we get a palindrome (2203432343022).
The spelling of 2201331012000 in words is "two trillion, two hundred one billion, three hundred thirty-one million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •