Base | Representation |
---|---|
bin | 10111101011001010010101… |
… | …111110100101010001011101 |
3 | 111122122212210102020102221122 |
4 | 113223022111332211101131 |
5 | 102121410020012303123 |
6 | 1005240325033140325 |
7 | 30634334153105204 |
oct | 2753122576452135 |
9 | 448585712212848 |
10 | 104121113400413 |
11 | 301a35750a009a |
12 | b81745225a6a5 |
13 | 461376a9bbc45 |
14 | 1b9d6bb2c423b |
15 | c08668361bc8 |
hex | 5eb295fa545d |
104121113400413 has 2 divisors, whose sum is σ = 104121113400414. Its totient is φ = 104121113400412.
The previous prime is 104121113400397. The next prime is 104121113400433. The reversal of 104121113400413 is 314004311121401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104119228277689 + 1885122724 = 10203883^2 + 43418^2 .
It is a cyclic number.
It is not a de Polignac number, because 104121113400413 - 24 = 104121113400397 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104121113400433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52060556700206 + 52060556700207.
It is an arithmetic number, because the mean of its divisors is an integer number (52060556700207).
Almost surely, 2104121113400413 is an apocalyptic number.
It is an amenable number.
104121113400413 is a deficient number, since it is larger than the sum of its proper divisors (1).
104121113400413 is an equidigital number, since it uses as much as digits as its factorization.
104121113400413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 104121113400413 its reverse (314004311121401), we get a palindrome (418125424521814).
The spelling of 104121113400413 in words is "one hundred four trillion, one hundred twenty-one billion, one hundred thirteen million, four hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •