Base | Representation |
---|---|
bin | 101101101101001110100100… |
… | …010100001100100000001001 |
3 | 222100202100001011122211120220 |
4 | 231231032210110030200021 |
5 | 202322003141421042301 |
6 | 1551311210354540253 |
7 | 60225136514563653 |
oct | 5555164424144011 |
9 | 870670034584526 |
10 | 201020111112201 |
11 | 59062172159527 |
12 | 1a667064597689 |
13 | 8822165c669c4 |
14 | 378d5d4dd76d3 |
15 | 1838edb1bd936 |
hex | b6d3a450c809 |
201020111112201 has 8 divisors (see below), whose sum is σ = 268028562249984. Its totient is φ = 134012533691280.
The previous prime is 201020111112131. The next prime is 201020111112203. The reversal of 201020111112201 is 102211111020102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201020111112201 - 215 = 201020111079433 is a prime.
It is a super-2 number, since 2×2010201111122012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201020111112203) 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, 217892185 + ... + 218812806.
It is an arithmetic number, because the mean of its divisors is an integer number (33503570281248).
Almost surely, 2201020111112201 is an apocalyptic number.
It is an amenable number.
201020111112201 is a deficient number, since it is larger than the sum of its proper divisors (67008451137783).
201020111112201 is a wasteful number, since it uses less digits than its factorization.
201020111112201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 436858431.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201020111112201 its reverse (102211111020102), we get a palindrome (303231222132303).
The spelling of 201020111112201 in words is "two hundred one trillion, twenty billion, one hundred eleven million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •