Base | Representation |
---|---|
bin | 110000011100001000… |
… | …1000011100010001001 |
3 | 100221111120000120222222 |
4 | 1200320101003202021 |
5 | 3201014420210441 |
6 | 115442042223425 |
7 | 10341535461035 |
oct | 1407021034211 |
9 | 327446016888 |
10 | 104023210121 |
11 | 40130432446 |
12 | 181b11b4b75 |
13 | 9a6a19974c |
14 | 506b4d71c5 |
15 | 2a8c546d4b |
hex | 1838443889 |
104023210121 has 2 divisors, whose sum is σ = 104023210122. Its totient is φ = 104023210120.
The previous prime is 104023210111. The next prime is 104023210133. The reversal of 104023210121 is 121012320401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103980451600 + 42758521 = 322460^2 + 6539^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104023210121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104023210121.
It is not a weakly prime, because it can be changed into another prime (104023210111) 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, 52011605060 + 52011605061.
It is an arithmetic number, because the mean of its divisors is an integer number (52011605061).
Almost surely, 2104023210121 is an apocalyptic number.
It is an amenable number.
104023210121 is a deficient number, since it is larger than the sum of its proper divisors (1).
104023210121 is an equidigital number, since it uses as much as digits as its factorization.
104023210121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 104023210121 its reverse (121012320401), we get a palindrome (225035530522).
The spelling of 104023210121 in words is "one hundred four billion, twenty-three million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •