Base | Representation |
---|---|
bin | 10111001101110000111110… |
… | …011111111100001101101001 |
3 | 111101111202120000101222202110 |
4 | 113031300332133330031221 |
5 | 101340310332321333001 |
6 | 1001052320150352533 |
7 | 30335361144045414 |
oct | 2715607637741551 |
9 | 441452500358673 |
10 | 102101011121001 |
11 | 2a594883012252 |
12 | b54ba3a05b749 |
13 | 44c811281baa9 |
14 | 1b2da02b26b7b |
15 | bc0d356633d6 |
hex | 5cdc3e7fc369 |
102101011121001 has 8 divisors (see below), whose sum is σ = 136394977254880. Its totient is φ = 67937192867232.
The previous prime is 102101011120943. The next prime is 102101011121023. The reversal of 102101011121001 is 100121110101201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102101011121001 - 239 = 101551255307113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102101011121071) 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 7 ways as a sum of consecutive naturals, for example, 32536968196 + ... + 32536971333.
It is an arithmetic number, because the mean of its divisors is an integer number (17049372156860).
Almost surely, 2102101011121001 is an apocalyptic number.
It is an amenable number.
102101011121001 is a deficient number, since it is larger than the sum of its proper divisors (34293966133879).
102101011121001 is an equidigital number, since it uses as much as digits as its factorization.
102101011121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65073940055.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 102101011121001 its reverse (100121110101201), we get a palindrome (202222121222202).
The spelling of 102101011121001 in words is "one hundred two trillion, one hundred one billion, eleven million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •