Base | Representation |
---|---|
bin | 10111011111001111110010… |
… | …001110000100010011010001 |
3 | 111112202121100110011022201202 |
4 | 113133033302032010103101 |
5 | 102020001123441210001 |
6 | 1003412233124240545 |
7 | 30521226562605365 |
oct | 2737176216042321 |
9 | 445677313138652 |
10 | 103302322210001 |
11 | 2aa082a588a972 |
12 | b704822840155 |
13 | 45844a0924bb5 |
14 | 1b71c0541b2a5 |
15 | be21e54ce96b |
hex | 5df3f23844d1 |
103302322210001 has 2 divisors, whose sum is σ = 103302322210002. Its totient is φ = 103302322210000.
The previous prime is 103302322209899. The next prime is 103302322210019. The reversal of 103302322210001 is 100012223203301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100598191918225 + 2704130291776 = 10029865^2 + 1644424^2 .
It is a cyclic number.
It is not a de Polignac number, because 103302322210001 - 214 = 103302322193617 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (103302322210081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51651161105000 + 51651161105001.
It is an arithmetic number, because the mean of its divisors is an integer number (51651161105001).
Almost surely, 2103302322210001 is an apocalyptic number.
It is an amenable number.
103302322210001 is a deficient number, since it is larger than the sum of its proper divisors (1).
103302322210001 is an equidigital number, since it uses as much as digits as its factorization.
103302322210001 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 20.
Adding to 103302322210001 its reverse (100012223203301), we get a palindrome (203314545413302).
The spelling of 103302322210001 in words is "one hundred three trillion, three hundred two billion, three hundred twenty-two million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •