Base | Representation |
---|---|
bin | 10111001111010110110001… |
… | …110100010000111111000001 |
3 | 111101220012200221100221201021 |
4 | 113033112301310100333001 |
5 | 101344103213410324301 |
6 | 1001214434531305441 |
7 | 30346311004222453 |
oct | 2717266164207701 |
9 | 441805627327637 |
10 | 102210320011201 |
11 | 2a627176035336 |
12 | b56906544b281 |
13 | 4505512a9cc8c |
14 | 1b350122082d3 |
15 | bc3ad1c428a1 |
hex | 5cf5b1d10fc1 |
102210320011201 has 4 divisors (see below), whose sum is σ = 104587304197552. Its totient is φ = 99833335824852.
The previous prime is 102210320011159. The next prime is 102210320011213. The reversal of 102210320011201 is 102110023012201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102210320011201 - 211 = 102210320009153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102210320011301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1188492093111 + ... + 1188492093196.
It is an arithmetic number, because the mean of its divisors is an integer number (26146826049388).
Almost surely, 2102210320011201 is an apocalyptic number.
It is an amenable number.
102210320011201 is a deficient number, since it is larger than the sum of its proper divisors (2376984186351).
102210320011201 is an equidigital number, since it uses as much as digits as its factorization.
102210320011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2376984186350.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102210320011201 its reverse (102110023012201), we get a palindrome (204320343023402).
The spelling of 102210320011201 in words is "one hundred two trillion, two hundred ten billion, three hundred twenty million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •