Base | Representation |
---|---|
bin | 10111101110001110111101… |
… | …101000101010011000101011 |
3 | 111200102001201122101122020012 |
4 | 113232032331220222120223 |
5 | 102133334402411442311 |
6 | 1005521322112322135 |
7 | 30655516654560446 |
oct | 2756167550523053 |
9 | 450361648348205 |
10 | 104332232140331 |
11 | 30275062120148 |
12 | b85035154334b |
13 | 462a64470ac60 |
14 | 1ba99c7d4465d |
15 | c0ddc29cc78b |
hex | 5ee3bda2a62b |
104332232140331 has 8 divisors (see below), whose sum is σ = 118271356272720. Its totient is φ = 91237903409952.
The previous prime is 104332232140319. The next prime is 104332232140333. The reversal of 104332232140331 is 133041232233401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104332232140331 - 210 = 104332232139307 is a prime.
It is a super-2 number, since 2×1043322321403312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104332232140333) 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, 211198850240 + ... + 211198850733.
It is an arithmetic number, because the mean of its divisors is an integer number (14783919534090).
Almost surely, 2104332232140331 is an apocalyptic number.
104332232140331 is a deficient number, since it is larger than the sum of its proper divisors (13939124132389).
104332232140331 is a wasteful number, since it uses less digits than its factorization.
104332232140331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422397701005.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 104332232140331 its reverse (133041232233401), we get a palindrome (237373464373732).
The spelling of 104332232140331 in words is "one hundred four trillion, three hundred thirty-two billion, two hundred thirty-two million, one hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •