Base | Representation |
---|---|
bin | 10111000000111101011111… |
… | …111010000100000001111101 |
3 | 111021101122100201122102200112 |
4 | 113000331133322010001331 |
5 | 101231401304422234323 |
6 | 555140155524435405 |
7 | 30214661205130151 |
oct | 2700753772040175 |
9 | 437348321572615 |
10 | 101221103321213 |
11 | 2a2856a0aa58a7 |
12 | b4293b2848b65 |
13 | 446315587cb65 |
14 | 1add1add87061 |
15 | ba7ed7016178 |
hex | 5c0f5fe8407d |
101221103321213 has 2 divisors, whose sum is σ = 101221103321214. Its totient is φ = 101221103321212.
The previous prime is 101221103321207. The next prime is 101221103321251. The reversal of 101221103321213 is 312123301122101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76374088557529 + 24847014763684 = 8739227^2 + 4984678^2 .
It is a cyclic number.
It is not a de Polignac number, because 101221103321213 - 232 = 101216808353917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101221105321213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50610551660606 + 50610551660607.
It is an arithmetic number, because the mean of its divisors is an integer number (50610551660607).
Almost surely, 2101221103321213 is an apocalyptic number.
It is an amenable number.
101221103321213 is a deficient number, since it is larger than the sum of its proper divisors (1).
101221103321213 is an equidigital number, since it uses as much as digits as its factorization.
101221103321213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 101221103321213 its reverse (312123301122101), we get a palindrome (413344404443314).
The spelling of 101221103321213 in words is "one hundred one trillion, two hundred twenty-one billion, one hundred three million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •