Base | Representation |
---|---|
bin | 10111011111010000100111… |
… | …101111101111110000111111 |
3 | 111112202200200000221112021022 |
4 | 113133100213233233300333 |
5 | 102020004443334344411 |
6 | 1003412502204054355 |
7 | 30521261045633156 |
oct | 2737204757576077 |
9 | 445680600845238 |
10 | 103303220231231 |
11 | 2aa08716790579 |
12 | b704a335343bb |
13 | 45845b49a79c7 |
14 | 1b71c8c7c059d |
15 | be2249269edb |
hex | 5df427befc3f |
103303220231231 has 2 divisors, whose sum is σ = 103303220231232. Its totient is φ = 103303220231230.
The previous prime is 103303220231219. The next prime is 103303220231279. The reversal of 103303220231231 is 132132022303301.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103303220231231 is a prime.
It is a super-2 number, since 2×1033032202312312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103303220231231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103303220221231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51651610115615 + 51651610115616.
It is an arithmetic number, because the mean of its divisors is an integer number (51651610115616).
Almost surely, 2103303220231231 is an apocalyptic number.
103303220231231 is a deficient number, since it is larger than the sum of its proper divisors (1).
103303220231231 is an equidigital number, since it uses as much as digits as its factorization.
103303220231231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 103303220231231 its reverse (132132022303301), we get a palindrome (235435242534532).
The spelling of 103303220231231 in words is "one hundred three trillion, three hundred three billion, two hundred twenty million, two hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •