Base | Representation |
---|---|
bin | 1100010010110… |
… | …00000010001001 |
3 | 21012001002110112 |
4 | 12021120002021 |
5 | 202344333113 |
6 | 14122124105 |
7 | 2361341261 |
oct | 611300211 |
9 | 235032415 |
10 | 103121033 |
11 | 532333a4 |
12 | 2a650635 |
13 | 18497282 |
14 | d9a47a1 |
15 | 90be5a8 |
hex | 6258089 |
103121033 has 2 divisors, whose sum is σ = 103121034. Its totient is φ = 103121032.
The previous prime is 103121023. The next prime is 103121047. The reversal of 103121033 is 330121301.
It is an a-pointer prime, because the next prime (103121047) can be obtained adding 103121033 to its sum of digits (14).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102981904 + 139129 = 10148^2 + 373^2 .
It is a cyclic number.
It is not a de Polignac number, because 103121033 - 220 = 102072457 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 103120999 and 103121017.
It is not a weakly prime, because it can be changed into another prime (103121023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51560516 + 51560517.
It is an arithmetic number, because the mean of its divisors is an integer number (51560517).
Almost surely, 2103121033 is an apocalyptic number.
It is an amenable number.
103121033 is a deficient number, since it is larger than the sum of its proper divisors (1).
103121033 is an equidigital number, since it uses as much as digits as its factorization.
103121033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 103121033 is about 10154.8526823386. The cubic root of 103121033 is about 468.9383506663.
Adding to 103121033 its reverse (330121301), we get a palindrome (433242334).
The spelling of 103121033 in words is "one hundred three million, one hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •