Base | Representation |
---|---|
bin | 110000100101010111… |
… | …1100111000110100101 |
3 | 100222022011100012220202 |
4 | 1201022233213012211 |
5 | 3202133300210041 |
6 | 115532514440245 |
7 | 10352321436605 |
oct | 1411257470645 |
9 | 328264305822 |
10 | 104333210021 |
11 | 4027a416a07 |
12 | 18278b93085 |
13 | 9ab9489041 |
14 | 509a750c05 |
15 | 2aa987da9b |
hex | 184abe71a5 |
104333210021 has 2 divisors, whose sum is σ = 104333210022. Its totient is φ = 104333210020.
The previous prime is 104333209997. The next prime is 104333210027. The reversal of 104333210021 is 120012333401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101184429025 + 3148780996 = 318095^2 + 56114^2 .
It is a cyclic number.
It is not a de Polignac number, because 104333210021 - 214 = 104333193637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104333209975 and 104333210002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104333210027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52166605010 + 52166605011.
It is an arithmetic number, because the mean of its divisors is an integer number (52166605011).
Almost surely, 2104333210021 is an apocalyptic number.
It is an amenable number.
104333210021 is a deficient number, since it is larger than the sum of its proper divisors (1).
104333210021 is an equidigital number, since it uses as much as digits as its factorization.
104333210021 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 104333210021 its reverse (120012333401), we get a palindrome (224345543422).
The spelling of 104333210021 in words is "one hundred four billion, three hundred thirty-three million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •