Base | Representation |
---|---|
bin | 101101101110011010111011… |
… | …001111110010000101011011 |
3 | 222101001011200010121112211010 |
4 | 231232122323033302011123 |
5 | 202324324100123210021 |
6 | 1551413010205505003 |
7 | 60234101341452360 |
oct | 5556327317620533 |
9 | 871034603545733 |
10 | 201102100210011 |
11 | 59093a159361a0 |
12 | 1a67ab26572163 |
13 | 8829b011c9770 |
14 | 3793571dd0467 |
15 | 183b1d90e9976 |
hex | b6e6bb3f215b |
201102100210011 has 128 divisors (see below), whose sum is σ = 362236564408320. Its totient is φ = 95837933260800.
The previous prime is 201102100209947. The next prime is 201102100210049. The reversal of 201102100210011 is 110012001201102.
It is not a de Polignac number, because 201102100210011 - 26 = 201102100209947 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201102100210511) 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 127 ways as a sum of consecutive naturals, for example, 1361585455 + ... + 1361733143.
It is an arithmetic number, because the mean of its divisors is an integer number (2829973159440).
Almost surely, 2201102100210011 is an apocalyptic number.
201102100210011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
201102100210011 is a deficient number, since it is larger than the sum of its proper divisors (161134464198309).
201102100210011 is a wasteful number, since it uses less digits than its factorization.
201102100210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150517.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201102100210011 its reverse (110012001201102), we get a palindrome (311114101411113).
The spelling of 201102100210011 in words is "two hundred one trillion, one hundred two billion, one hundred million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •