Base | Representation |
---|---|
bin | 10111101110101010000110… |
… | …000011100000001010110111 |
3 | 111200111211220220220221200101 |
4 | 113232222012003200022313 |
5 | 102134324033243021401 |
6 | 1005542540550254531 |
7 | 30660600620105260 |
oct | 2756520603401267 |
9 | 450454826827611 |
10 | 104361364423351 |
11 | 30286451581602 |
12 | b855b21957447 |
13 | 46303080a0849 |
14 | 1bab18d037967 |
15 | c0ea2a355101 |
hex | 5eea860e02b7 |
104361364423351 has 8 divisors (see below), whose sum is σ = 119270437092224. Its totient is φ = 89452368335160.
The previous prime is 104361364423343. The next prime is 104361364423451. The reversal of 104361364423351 is 153324463163401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104361364423351 - 23 = 104361364423343 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104361364423321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16194645 + ... + 21702286.
It is an arithmetic number, because the mean of its divisors is an integer number (14908804636528).
Almost surely, 2104361364423351 is an apocalyptic number.
104361364423351 is a deficient number, since it is larger than the sum of its proper divisors (14909072668873).
104361364423351 is an equidigital number, since it uses as much as digits as its factorization.
104361364423351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38290341.
The product of its (nonzero) digits is 1866240, while the sum is 46.
The spelling of 104361364423351 in words is "one hundred four trillion, three hundred sixty-one billion, three hundred sixty-four million, four hundred twenty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •