Base | Representation |
---|---|
bin | 10111001100011101010110… |
… | …101010000000100000100001 |
3 | 111101012011210110112010102011 |
4 | 113030131112222000200201 |
5 | 101332322440324200001 |
6 | 1000543150344152521 |
7 | 30326032116004114 |
oct | 2714352652004041 |
9 | 441164713463364 |
10 | 102011222100001 |
11 | 2a55a7974a2875 |
12 | b53655ba68741 |
13 | 44bc803629176 |
14 | 1b29525c6857b |
15 | bbd82caadd51 |
hex | 5cc756a80821 |
102011222100001 has 8 divisors (see below), whose sum is σ = 109880250453504. Its totient is φ = 94428340232160.
The previous prime is 102011222099953. The next prime is 102011222100031. The reversal of 102011222100001 is 100001222110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-102011222100001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102011222100031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71536620676 + ... + 71536622101.
It is an arithmetic number, because the mean of its divisors is an integer number (13735031306688).
Almost surely, 2102011222100001 is an apocalyptic number.
It is an amenable number.
102011222100001 is a deficient number, since it is larger than the sum of its proper divisors (7869028353503).
102011222100001 is a wasteful number, since it uses less digits than its factorization.
102011222100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143073242831.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102011222100001 its reverse (100001222110201), we get a palindrome (202012444210202).
The spelling of 102011222100001 in words is "one hundred two trillion, eleven billion, two hundred twenty-two million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •