Base | Representation |
---|---|
bin | 10110111101101111110010… |
… | …001111110101000010010111 |
3 | 111020121112020000002022220110 |
4 | 112331233302033311002113 |
5 | 101214241422332413421 |
6 | 554450505520534103 |
7 | 30163011416443110 |
oct | 2675576217650227 |
9 | 436545200068813 |
10 | 101000220201111 |
11 | 2a1aaa53262460 |
12 | b3b2629481333 |
13 | 4448383c1c8aa |
14 | 1ad26185b9207 |
15 | ba23aa530a76 |
hex | 5bdbf23f5097 |
101000220201111 has 16 divisors (see below), whose sum is σ = 167896469945088. Its totient is φ = 52467646857600.
The previous prime is 101000220201053. The next prime is 101000220201131. The reversal of 101000220201111 is 111102022000101.
It is not a de Polignac number, because 101000220201111 - 215 = 101000220168343 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000220201131) 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 15 ways as a sum of consecutive naturals, for example, 218615195010 + ... + 218615195471.
It is an arithmetic number, because the mean of its divisors is an integer number (10493529371568).
Almost surely, 2101000220201111 is an apocalyptic number.
101000220201111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101000220201111 is a deficient number, since it is larger than the sum of its proper divisors (66896249743977).
101000220201111 is a wasteful number, since it uses less digits than its factorization.
101000220201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437230390502.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101000220201111 its reverse (111102022000101), we get a palindrome (212102242201212).
The spelling of 101000220201111 in words is "one hundred one trillion, two hundred twenty million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •