Base | Representation |
---|---|
bin | 101101101101001110100011… |
… | …101110000101000001011011 |
3 | 222100202100000110212011222202 |
4 | 231231032203232011001123 |
5 | 202322003131341320331 |
6 | 1551311205400440415 |
7 | 60225136333626311 |
oct | 5555164356050133 |
9 | 870670013764882 |
10 | 201020101120091 |
11 | 59062167554290 |
12 | 1a66706117910b |
13 | 8822163b78906 |
14 | 378d5d39560b1 |
15 | 1838eda397ecb |
hex | b6d3a3b8505b |
201020101120091 has 8 divisors (see below), whose sum is σ = 219301801844400. Its totient is φ = 182739591408640.
The previous prime is 201020101120063. The next prime is 201020101120117. The reversal of 201020101120091 is 190021101020102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201020101120091 - 246 = 130651356942427 is a prime.
It is a super-2 number, since 2×2010201011200912 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201020101120001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 297400286 + ... + 298075443.
It is an arithmetic number, because the mean of its divisors is an integer number (27412725230550).
Almost surely, 2201020101120091 is an apocalyptic number.
201020101120091 is a deficient number, since it is larger than the sum of its proper divisors (18281700724309).
201020101120091 is a wasteful number, since it uses less digits than its factorization.
201020101120091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 595506429.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 201020101120091 its reverse (190021101020102), we get a palindrome (391041202140193).
The spelling of 201020101120091 in words is "two hundred one trillion, twenty billion, one hundred one million, one hundred twenty thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •