Base | Representation |
---|---|
bin | 1011101100110100110… |
… | …1010101010011000000 |
3 | 201012211211021001201201 |
4 | 2323031031111103000 |
5 | 11243132344220000 |
6 | 232202054110544 |
7 | 20344151012551 |
oct | 2731515252300 |
9 | 635754231651 |
10 | 201011320000 |
11 | 78280716957 |
12 | 32b5a34b454 |
13 | 15c559c098a |
14 | 9a2c538328 |
15 | 536713e96a |
hex | 2ecd3554c0 |
201011320000 has 140 divisors (see below), whose sum is σ = 500096886520. Its totient is φ = 80137728000.
The previous prime is 201011319979. The next prime is 201011320051. The reversal of 201011320000 is 23110102.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 12271816 + ... + 12288184.
It is an arithmetic number, because the mean of its divisors is an integer number (3572120618).
Almost surely, 2201011320000 is an apocalyptic number.
201011320000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201011320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (250048443260).
201011320000 is an abundant number, since it is smaller than the sum of its proper divisors (299085566520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201011320000 is an equidigital number, since it uses as much as digits as its factorization.
201011320000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16708 (or 16683 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 201011320000 its reverse (23110102), we get a palindrome (201034430102).
The spelling of 201011320000 in words is "two hundred one billion, eleven million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •