Base | Representation |
---|---|
bin | 101101101100111100110111… |
… | …111000101110000101011011 |
3 | 222100200112000002200002010012 |
4 | 231230330313320232011123 |
5 | 202321200234144214321 |
6 | 1551254345224112135 |
7 | 60223564635630242 |
oct | 5554746770560533 |
9 | 870615002602105 |
10 | 201001112101211 |
11 | 59055102769354 |
12 | 1a66344190564b |
13 | 8820428a84476 |
14 | 378c711a39959 |
15 | 183877827c05b |
hex | b6cf37e2e15b |
201001112101211 has 32 divisors (see below), whose sum is σ = 213291733483008. Its totient is φ = 188763058091520.
The previous prime is 201001112101201. The next prime is 201001112101219. The reversal of 201001112101211 is 112101211100102.
It is a cyclic number.
It is not a de Polignac number, because 201001112101211 - 26 = 201001112101147 is a prime.
It is a super-2 number, since 2×2010011121012112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201001112101219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79415689016 + ... + 79415691546.
It is an arithmetic number, because the mean of its divisors is an integer number (6665366671344).
Almost surely, 2201001112101211 is an apocalyptic number.
201001112101211 is a deficient number, since it is larger than the sum of its proper divisors (12290621381797).
201001112101211 is a wasteful number, since it uses less digits than its factorization.
201001112101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7571.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 201001112101211 its reverse (112101211100102), we get a palindrome (313102323201313).
The spelling of 201001112101211 in words is "two hundred one trillion, one billion, one hundred twelve million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •