Base | Representation |
---|---|
bin | 101111100010110110… |
… | …0011111010100111011 |
3 | 100202112121002022121202 |
4 | 1133011230133110323 |
5 | 3133100330201021 |
6 | 114523215124415 |
7 | 10243105240052 |
oct | 1370554372473 |
9 | 322477068552 |
10 | 102101022011 |
11 | 3a33440202a |
12 | 1795551370b |
13 | 9821b97831 |
14 | 4d280d5399 |
15 | 29c8904a0b |
hex | 17c5b1f53b |
102101022011 has 4 divisors (see below), whose sum is σ = 102101668272. Its totient is φ = 102100375752.
The previous prime is 102101021947. The next prime is 102101022047. The reversal of 102101022011 is 110220101201.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 102101022011 - 26 = 102101021947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102101021983 and 102101022001.
It is not an unprimeable number, because it can be changed into a prime (102101022061) 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 3 ways as a sum of consecutive naturals, for example, 89441 + ... + 460653.
It is an arithmetic number, because the mean of its divisors is an integer number (25525417068).
Almost surely, 2102101022011 is an apocalyptic number.
102101022011 is a deficient number, since it is larger than the sum of its proper divisors (646261).
102101022011 is an equidigital number, since it uses as much as digits as its factorization.
102101022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646260.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102101022011 its reverse (110220101201), we get a palindrome (212321123212).
The spelling of 102101022011 in words is "one hundred two billion, one hundred one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •