Base | Representation |
---|---|
bin | 101101101100111101000100… |
… | …011101010010001111101100 |
3 | 222100200112112210112111211122 |
4 | 231230331010131102033230 |
5 | 202321201202142404400 |
6 | 1551254422200440112 |
7 | 60223603106432561 |
oct | 5554750435221754 |
9 | 870615483474748 |
10 | 201001323013100 |
11 | 590552008245a5 |
12 | 1a6634a0479038 |
13 | 882046068c3bc |
14 | 378c731a5c868 |
15 | 183878ba3e685 |
hex | b6cf447523ec |
201001323013100 has 72 divisors (see below), whose sum is σ = 459726773884560. Its totient is φ = 76163416026880.
The previous prime is 201001323013067. The next prime is 201001323013177. The reversal of 201001323013100 is 1310323100102.
It is a super-2 number, since 2×2010013230131002 (a number of 29 digits) contains 22 as substring.
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, 653721782 + ... + 654029181.
It is an arithmetic number, because the mean of its divisors is an integer number (6385094081730).
Almost surely, 2201001323013100 is an apocalyptic number.
201001323013100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201001323013100 is an abundant number, since it is smaller than the sum of its proper divisors (258725450871460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201001323013100 is a wasteful number, since it uses less digits than its factorization.
201001323013100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1307751059 (or 1307751052 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 201001323013100 its reverse (1310323100102), we get a palindrome (202311646113202).
The spelling of 201001323013100 in words is "two hundred one trillion, one billion, three hundred twenty-three million, thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •