Base | Representation |
---|---|
bin | 110000100101000100… |
… | …1011110000100000001 |
3 | 100222021110112020112221 |
4 | 1201022021132010001 |
5 | 3202123220232041 |
6 | 115531520251041 |
7 | 10352140444504 |
oct | 1411211360401 |
9 | 328243466487 |
10 | 104323211521 |
11 | 40274807991 |
12 | 18275770a81 |
13 | 9ab7398079 |
14 | 50992ab13b |
15 | 2aa8a562d1 |
hex | 184a25e101 |
104323211521 has 2 divisors, whose sum is σ = 104323211522. Its totient is φ = 104323211520.
The previous prime is 104323211413. The next prime is 104323211539. The reversal of 104323211521 is 125112323401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87563319921 + 16759891600 = 295911^2 + 129460^2 .
It is a cyclic number.
It is not a de Polignac number, because 104323211521 - 221 = 104321114369 is a prime.
It is not a weakly prime, because it can be changed into another prime (104323214521) 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, 52161605760 + 52161605761.
It is an arithmetic number, because the mean of its divisors is an integer number (52161605761).
Almost surely, 2104323211521 is an apocalyptic number.
It is an amenable number.
104323211521 is a deficient number, since it is larger than the sum of its proper divisors (1).
104323211521 is an equidigital number, since it uses as much as digits as its factorization.
104323211521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 104323211521 its reverse (125112323401), we get a palindrome (229435534922).
It can be divided in two parts, 104323 and 211521, that added together give a square (315844 = 5622).
The spelling of 104323211521 in words is "one hundred four billion, three hundred twenty-three million, two hundred eleven thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •