Base | Representation |
---|---|
bin | 10111101110001101001011… |
… | …001000010000000010110011 |
3 | 111200101212202202111200122122 |
4 | 113232031023020100002303 |
5 | 102133321434111304303 |
6 | 1005520403324424455 |
7 | 30655421236523402 |
oct | 2756151310200263 |
9 | 450355682450578 |
10 | 104330311041203 |
11 | 30274266773a15 |
12 | b84bab60a812b |
13 | 462a3c96ca900 |
14 | 1ba9884b47639 |
15 | c0dd0e002e38 |
hex | 5ee34b2100b3 |
104330311041203 has 12 divisors (see below), whose sum is σ = 112979585694528. Its totient is φ = 96299338505760.
The previous prime is 104330311041191. The next prime is 104330311041221. The reversal of 104330311041203 is 302140113033401.
It is not a de Polignac number, because 104330311041203 - 218 = 104330310779059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104330311041283) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14898083 + ... + 20751228.
It is an arithmetic number, because the mean of its divisors is an integer number (9414965474544).
Almost surely, 2104330311041203 is an apocalyptic number.
104330311041203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
104330311041203 is a deficient number, since it is larger than the sum of its proper divisors (8649274653325).
104330311041203 is a wasteful number, since it uses less digits than its factorization.
104330311041203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35666654 (or 35666641 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 104330311041203 its reverse (302140113033401), we get a palindrome (406470424074604).
The spelling of 104330311041203 in words is "one hundred four trillion, three hundred thirty billion, three hundred eleven million, forty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •