Base | Representation |
---|---|
bin | 10111001111010110101011… |
… | …111110110011010100110001 |
3 | 111101220012110010011001111220 |
4 | 113033112223332303110301 |
5 | 101344103013330010001 |
6 | 1001214421113055253 |
7 | 30346305405121305 |
oct | 2717265376632461 |
9 | 441805403131456 |
10 | 102210222110001 |
11 | 2a627125847755 |
12 | b5690386b7529 |
13 | 45054c8712885 |
14 | 1b35003201d05 |
15 | bc3ac8354c36 |
hex | 5cf5abfb3531 |
102210222110001 has 8 divisors (see below), whose sum is σ = 136986411671520. Its totient is φ = 67787090310912.
The previous prime is 102210222109999. The next prime is 102210222110033. The reversal of 102210222110001 is 100011222012201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102210222110001 - 21 = 102210222109999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102210222110501) 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, 88264439931 + ... + 88264441088.
It is an arithmetic number, because the mean of its divisors is an integer number (17123301458940).
Almost surely, 2102210222110001 is an apocalyptic number.
It is an amenable number.
102210222110001 is a deficient number, since it is larger than the sum of its proper divisors (34776189561519).
102210222110001 is a wasteful number, since it uses less digits than its factorization.
102210222110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176528881215.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102210222110001 its reverse (100011222012201), we get a palindrome (202221444122202).
The spelling of 102210222110001 in words is "one hundred two trillion, two hundred ten billion, two hundred twenty-two million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •