Base | Representation |
---|---|
bin | 101111111110100110… |
… | …0000000100001000101 |
3 | 100211221110221111021022 |
4 | 1133331030000201011 |
5 | 3142002200000201 |
6 | 115155434000525 |
7 | 10305141546623 |
oct | 1377514004105 |
9 | 324843844238 |
10 | 103032031301 |
11 | 3a7719940a1 |
12 | 17b75276145 |
13 | 993ca2a6c4 |
14 | 4db5a04513 |
15 | 2a3050941b |
hex | 17fd300845 |
103032031301 has 2 divisors, whose sum is σ = 103032031302. Its totient is φ = 103032031300.
The previous prime is 103032031279. The next prime is 103032031309. The reversal of 103032031301 is 103130230301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102895959076 + 136072225 = 320774^2 + 11665^2 .
It is a cyclic number.
It is not a de Polignac number, because 103032031301 - 218 = 103031769157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103032031301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103032031309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51516015650 + 51516015651.
It is an arithmetic number, because the mean of its divisors is an integer number (51516015651).
Almost surely, 2103032031301 is an apocalyptic number.
It is an amenable number.
103032031301 is a deficient number, since it is larger than the sum of its proper divisors (1).
103032031301 is an equidigital number, since it uses as much as digits as its factorization.
103032031301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 103032031301 its reverse (103130230301), we get a palindrome (206162261602).
The spelling of 103032031301 in words is "one hundred three billion, thirty-two million, thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •