Base | Representation |
---|---|
bin | 1100011011001… |
… | …10110010010001 |
3 | 21021010102201121 |
4 | 12031212302101 |
5 | 203140330113 |
6 | 14202002241 |
7 | 2403640435 |
oct | 615466221 |
9 | 237112647 |
10 | 104230033 |
11 | 53920626 |
12 | 2aaa6381 |
13 | 18794c9b |
14 | dbb29c5 |
15 | 923ce8d |
hex | 6366c91 |
104230033 has 2 divisors, whose sum is σ = 104230034. Its totient is φ = 104230032.
The previous prime is 104229949. The next prime is 104230039. The reversal of 104230033 is 330032401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93161104 + 11068929 = 9652^2 + 3327^2 .
It is an emirp because it is prime and its reverse (330032401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104230033 - 213 = 104221841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104229989 and 104230016.
It is not a weakly prime, because it can be changed into another prime (104230039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52115016 + 52115017.
It is an arithmetic number, because the mean of its divisors is an integer number (52115017).
Almost surely, 2104230033 is an apocalyptic number.
It is an amenable number.
104230033 is a deficient number, since it is larger than the sum of its proper divisors (1).
104230033 is an equidigital number, since it uses as much as digits as its factorization.
104230033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 16.
The square root of 104230033 is about 10209.3110933109. The cubic root of 104230033 is about 470.6134031052.
Adding to 104230033 its reverse (330032401), we get a palindrome (434262434).
The spelling of 104230033 in words is "one hundred four million, two hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •