Base | Representation |
---|---|
bin | 101101101101010000010101… |
… | …100100000100101101101011 |
3 | 222100202111221120211012212210 |
4 | 231231100111210010231223 |
5 | 202322021034320200021 |
6 | 1551312123110140203 |
7 | 60225234555323013 |
oct | 5555202544045553 |
9 | 870674846735783 |
10 | 201022011100011 |
11 | 59062a576a6492 |
12 | 1a6674b4951663 |
13 | 88223a9794b4a |
14 | 378d73549ac43 |
15 | 183909cdc7e76 |
hex | b6d415904b6b |
201022011100011 has 16 divisors (see below), whose sum is σ = 282246494873600. Its totient is φ = 126911617643808.
The previous prime is 201022011099997. The next prime is 201022011100019. The reversal of 201022011100011 is 110001110220102.
It is not a de Polignac number, because 201022011100011 - 217 = 201022010968939 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201022011100011.
It is not an unprimeable number, because it can be changed into a prime (201022011100019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 689471371 + ... + 689762868.
It is an arithmetic number, because the mean of its divisors is an integer number (17640405929600).
Almost surely, 2201022011100011 is an apocalyptic number.
201022011100011 is a deficient number, since it is larger than the sum of its proper divisors (81224483773589).
201022011100011 is a wasteful number, since it uses less digits than its factorization.
201022011100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1379236818.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201022011100011 its reverse (110001110220102), we get a palindrome (311023121320113).
The spelling of 201022011100011 in words is "two hundred one trillion, twenty-two billion, eleven million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •