Base | Representation |
---|---|
bin | 10111001100011101010000… |
… | …000010010001110110111011 |
3 | 111101012011111201111210001112 |
4 | 113030131100002101312323 |
5 | 101332322223410201021 |
6 | 1000543131335310535 |
7 | 30326026266602432 |
oct | 2714352002216673 |
9 | 441164451453045 |
10 | 102011111022011 |
11 | 2a55a73a825284 |
12 | b53652a81b44b |
13 | 44bc7b6607249 |
14 | 1b295151d2119 |
15 | bbd822e6bd5b |
hex | 5cc750091dbb |
102011111022011 has 8 divisors (see below), whose sum is σ = 103742505888000. Its totient is φ = 100279795922280.
The previous prime is 102011111021977. The next prime is 102011111022059. The reversal of 102011111022011 is 110220111110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102011111022011 - 214 = 102011111005627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102011111022211) 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 7 ways as a sum of consecutive naturals, for example, 17359295 + ... + 22480376.
It is an arithmetic number, because the mean of its divisors is an integer number (12967813236000).
Almost surely, 2102011111022011 is an apocalyptic number.
102011111022011 is a deficient number, since it is larger than the sum of its proper divisors (1731394865989).
102011111022011 is an equidigital number, since it uses as much as digits as its factorization.
102011111022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39883129.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102011111022011 its reverse (110220111110201), we get a palindrome (212231222132212).
The spelling of 102011111022011 in words is "one hundred two trillion, eleven billion, one hundred eleven million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •