Base | Representation |
---|---|
bin | 10111001100011101001111… |
… | …111111001011110110111001 |
3 | 111101012011111122222120120010 |
4 | 113030131033333023312321 |
5 | 101332322223203223001 |
6 | 1000543131310052133 |
7 | 30326026256654115 |
oct | 2714351777136671 |
9 | 441164448876503 |
10 | 102011110211001 |
11 | 2a55a73a320a22 |
12 | b53652a4aa049 |
13 | 44bc7b63b2064 |
14 | 1b29515060745 |
15 | bbd822d5b8d6 |
hex | 5cc74ffcbdb9 |
102011110211001 has 8 divisors (see below), whose sum is σ = 143173488015520. Its totient is φ = 64428069606912.
The previous prime is 102011110210993. The next prime is 102011110211063. The reversal of 102011110211001 is 100112011110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102011110211001 - 23 = 102011110210993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102011110210001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 894834300040 + ... + 894834300153.
It is an arithmetic number, because the mean of its divisors is an integer number (17896686001940).
Almost surely, 2102011110211001 is an apocalyptic number.
It is an amenable number.
102011110211001 is a deficient number, since it is larger than the sum of its proper divisors (41162377804519).
102011110211001 is a wasteful number, since it uses less digits than its factorization.
102011110211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1789668600215.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 102011110211001 its reverse (100112011110201), we get a palindrome (202123121321202).
The spelling of 102011110211001 in words is "one hundred two trillion, eleven billion, one hundred ten million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •