Base | Representation |
---|---|
bin | 10111100001110101010111… |
… | …011101100101110100111110 |
3 | 111120101121021002121021101020 |
4 | 113201311113131211310332 |
5 | 102030404233243444223 |
6 | 1004030035220525010 |
7 | 30540122462604654 |
oct | 2741652735456476 |
9 | 446347232537336 |
10 | 103480114437438 |
11 | 2aa76740973922 |
12 | b733180b50766 |
13 | 459819604603b |
14 | 1b7a66dd14dd4 |
15 | be6b4de831e3 |
hex | 5e1d57765d3e |
103480114437438 has 8 divisors (see below), whose sum is σ = 206960228874888. Its totient is φ = 34493371479144.
The previous prime is 103480114437433. The next prime is 103480114437473. The reversal of 103480114437438 is 834734411084301.
It is a sphenic number, since it is the product of 3 distinct primes.
103480114437438 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103480114437433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8623342869781 + ... + 8623342869792.
It is an arithmetic number, because the mean of its divisors is an integer number (25870028609361).
Almost surely, 2103480114437438 is an apocalyptic number.
103480114437438 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103480114437438 is a wasteful number, since it uses less digits than its factorization.
103480114437438 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17246685739578.
The product of its (nonzero) digits is 3096576, while the sum is 51.
The spelling of 103480114437438 in words is "one hundred three trillion, four hundred eighty billion, one hundred fourteen million, four hundred thirty-seven thousand, four hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •