Base | Representation |
---|---|
bin | 10111011110000111001101… |
… | …101101010001010001111111 |
3 | 111112111011012221012011100122 |
4 | 113132013031231101101333 |
5 | 102012212032424040221 |
6 | 1003312345041445155 |
7 | 30512500602616655 |
oct | 2736071555212177 |
9 | 445434187164318 |
10 | 103224400221311 |
11 | 2a988249963506 |
12 | b6b16b69407bb |
13 | 457a03317c595 |
14 | 1b6c132646dd5 |
15 | be0184682eab |
hex | 5de1cdb5147f |
103224400221311 has 16 divisors (see below), whose sum is σ = 104563615392000. Its totient is φ = 101895705408000.
The previous prime is 103224400221253. The next prime is 103224400221331. The reversal of 103224400221311 is 113122004422301.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103224400221311 is a prime.
It is a super-3 number, since 3×1032244002213113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103224400221331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12861266 + ... + 19283696.
It is an arithmetic number, because the mean of its divisors is an integer number (6535225962000).
Almost surely, 2103224400221311 is an apocalyptic number.
103224400221311 is a deficient number, since it is larger than the sum of its proper divisors (1339215170689).
103224400221311 is a wasteful number, since it uses less digits than its factorization.
103224400221311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6423250.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 103224400221311 its reverse (113122004422301), we get a palindrome (216346404643612).
The spelling of 103224400221311 in words is "one hundred three trillion, two hundred twenty-four billion, four hundred million, two hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •