Base | Representation |
---|---|
bin | 10111011101110001101110… |
… | …000101110010110110100001 |
3 | 111112101221122111221110100201 |
4 | 113131301232011302312201 |
5 | 102011322301211413212 |
6 | 1003254011002145201 |
7 | 30511022642314432 |
oct | 2735615605626641 |
9 | 445357574843321 |
10 | 103201321201057 |
11 | 2a979486401a52 |
12 | b6a91357b2201 |
13 | 4577ac5913c91 |
14 | 1b6ad83469489 |
15 | bde783464b57 |
hex | 5ddc6e172da1 |
103201321201057 has 2 divisors, whose sum is σ = 103201321201058. Its totient is φ = 103201321201056.
The previous prime is 103201321201021. The next prime is 103201321201061. The reversal of 103201321201057 is 750102123102301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88397303136256 + 14804018064801 = 9401984^2 + 3847599^2 .
It is an emirp because it is prime and its reverse (750102123102301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103201321201057 is a prime.
It is not a weakly prime, because it can be changed into another prime (103201325201057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51600660600528 + 51600660600529.
It is an arithmetic number, because the mean of its divisors is an integer number (51600660600529).
Almost surely, 2103201321201057 is an apocalyptic number.
It is an amenable number.
103201321201057 is a deficient number, since it is larger than the sum of its proper divisors (1).
103201321201057 is an equidigital number, since it uses as much as digits as its factorization.
103201321201057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2520, while the sum is 28.
Adding to 103201321201057 its reverse (750102123102301), we get a palindrome (853303444303358).
The spelling of 103201321201057 in words is "one hundred three trillion, two hundred one billion, three hundred twenty-one million, two hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •