Base | Representation |
---|---|
bin | 101101101101001111011010… |
… | …100011001001010110011000 |
3 | 222100202102101120202222112012 |
4 | 231231033122203021112120 |
5 | 202322012022334013422 |
6 | 1551311440541005052 |
7 | 60225201203530214 |
oct | 5555173243112630 |
9 | 870672346688465 |
10 | 201021021001112 |
11 | 59062599825534 |
12 | 1a667279253788 |
13 | 882227c613500 |
14 | 378d67dba9944 |
15 | 18390410004e2 |
hex | b6d3da8c9598 |
201021021001112 has 96 divisors (see below), whose sum is σ = 421364887695360. Its totient is φ = 89773053552000.
The previous prime is 201021021001093. The next prime is 201021021001127. The reversal of 201021021001112 is 211100120120102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 291824537 + ... + 292512567.
It is an arithmetic number, because the mean of its divisors is an integer number (4389217580160).
Almost surely, 2201021021001112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201021021001112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (210682443847680).
201021021001112 is an abundant number, since it is smaller than the sum of its proper divisors (220343866694248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201021021001112 is a wasteful number, since it uses less digits than its factorization.
201021021001112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695065 (or 695048 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201021021001112 its reverse (211100120120102), we get a palindrome (412121141121214).
The spelling of 201021021001112 in words is "two hundred one trillion, twenty-one billion, twenty-one million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •