Base | Representation |
---|---|
bin | 10111101110001101000101… |
… | …011110111000010100100101 |
3 | 111200101212112011020211221112 |
4 | 113232031011132320110211 |
5 | 102133321240333410203 |
6 | 1005520350102154405 |
7 | 30655416006364316 |
oct | 2756150536702445 |
9 | 450355464224845 |
10 | 104330216310053 |
11 | 30274218251008 |
12 | b84ba8a422a05 |
13 | 462a3b2bb0386 |
14 | 1ba987632860d |
15 | c0dd05a3e6d8 |
hex | 5ee3457b8525 |
104330216310053 has 8 divisors (see below), whose sum is σ = 104660196150240. Its totient is φ = 104000241894640.
The previous prime is 104330216310007. The next prime is 104330216310097. The reversal of 104330216310053 is 350013612033401.
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 104330216310053 - 214 = 104330216293669 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 (104330216310953) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39071558 + ... + 41656296.
It is an arithmetic number, because the mean of its divisors is an integer number (13082524518780).
Almost surely, 2104330216310053 is an apocalyptic number.
It is an amenable number.
104330216310053 is a deficient number, since it is larger than the sum of its proper divisors (329979840187).
104330216310053 is a wasteful number, since it uses less digits than its factorization.
104330216310053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2712387.
The product of its (nonzero) digits is 19440, while the sum is 32.
Adding to 104330216310053 its reverse (350013612033401), we get a palindrome (454343828343454).
The spelling of 104330216310053 in words is "one hundred four trillion, three hundred thirty billion, two hundred sixteen million, three hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •