Base | Representation |
---|---|
bin | 101111111110100101… |
… | …1111001001101100101 |
3 | 100211221110212222020011 |
4 | 1133331023321031211 |
5 | 3142002143021011 |
6 | 115155433210221 |
7 | 10305141363451 |
oct | 1377513711545 |
9 | 324843788204 |
10 | 103032001381 |
11 | 3a771973671 |
12 | 17b75260971 |
13 | 993ca19bba |
14 | 4db59d7661 |
15 | 2a30500621 |
hex | 17fd2f9365 |
103032001381 has 2 divisors, whose sum is σ = 103032001382. Its totient is φ = 103032001380.
The previous prime is 103032001307. The next prime is 103032001403. The reversal of 103032001381 is 183100230301.
It is an a-pointer prime, because the next prime (103032001403) can be obtained adding 103032001381 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89239612900 + 13792388481 = 298730^2 + 117441^2 .
It is a cyclic number.
It is not a de Polignac number, because 103032001381 - 27 = 103032001253 is a prime.
It is a super-2 number, since 2×1030320013812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103032001301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51516000690 + 51516000691.
It is an arithmetic number, because the mean of its divisors is an integer number (51516000691).
Almost surely, 2103032001381 is an apocalyptic number.
It is an amenable number.
103032001381 is a deficient number, since it is larger than the sum of its proper divisors (1).
103032001381 is an equidigital number, since it uses as much as digits as its factorization.
103032001381 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 103032001381 its reverse (183100230301), we get a palindrome (286132231682).
The spelling of 103032001381 in words is "one hundred three billion, thirty-two million, one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •