Base | Representation |
---|---|
bin | 10111101110100010011100… |
… | …000111110000010001100011 |
3 | 111200111001201002001211211011 |
4 | 113232202130013300101203 |
5 | 102134210220020431201 |
6 | 1005535101201201351 |
7 | 30660160130452240 |
oct | 2756423407602143 |
9 | 450431632054734 |
10 | 104353144702051 |
11 | 30282a13781303 |
12 | b854409030257 |
13 | 462c5c8189b2b |
14 | 1baaa0d4d65c7 |
15 | c0e6e8907151 |
hex | 5ee89c1f0463 |
104353144702051 has 8 divisors (see below), whose sum is σ = 119265953762144. Its totient is φ = 89441639881920.
The previous prime is 104353144701997. The next prime is 104353144702057. The reversal of 104353144702051 is 150207441353401.
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 104353144702051 - 211 = 104353144700003 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104353144701995 and 104353144702013.
It is not an unprimeable number, because it can be changed into a prime (104353144702057) 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, 325888530 + ... + 326208583.
It is an arithmetic number, because the mean of its divisors is an integer number (14908244220268).
Almost surely, 2104353144702051 is an apocalyptic number.
104353144702051 is a deficient number, since it is larger than the sum of its proper divisors (14912809060093).
104353144702051 is an equidigital number, since it uses as much as digits as its factorization.
104353144702051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652119981.
The product of its (nonzero) digits is 201600, while the sum is 40.
The spelling of 104353144702051 in words is "one hundred four trillion, three hundred fifty-three billion, one hundred forty-four million, seven hundred two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •