Base | Representation |
---|---|
bin | 10111101001100110100111… |
… | …110000001110011000110011 |
3 | 111122021122102002221021111122 |
4 | 113221212213300032120303 |
5 | 102113131222041203042 |
6 | 1005115220015532455 |
7 | 30623523545355455 |
oct | 2751464760163063 |
9 | 448248362837448 |
10 | 104014037444147 |
11 | 30162118551356 |
12 | b7ba74a82a12b |
13 | 460663523093c |
14 | 1b984405b42d5 |
15 | c0599cd077d2 |
hex | 5e99a7c0e633 |
104014037444147 has 4 divisors (see below), whose sum is σ = 104014238112840. Its totient is φ = 104013836775456.
The previous prime is 104014037444131. The next prime is 104014037444159. The reversal of 104014037444147 is 741444730410401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 104014037444147 - 24 = 104014037444131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104014037444098 and 104014037444107.
It is not an unprimeable number, because it can be changed into a prime (104014037447147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99554822 + ... + 100594187.
It is an arithmetic number, because the mean of its divisors is an integer number (26003559528210).
Almost surely, 2104014037444147 is an apocalyptic number.
104014037444147 is a deficient number, since it is larger than the sum of its proper divisors (200668693).
104014037444147 is an equidigital number, since it uses as much as digits as its factorization.
104014037444147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200668692.
The product of its (nonzero) digits is 602112, while the sum is 44.
Adding to 104014037444147 its reverse (741444730410401), we get a palindrome (845458767854548).
The spelling of 104014037444147 in words is "one hundred four trillion, fourteen billion, thirty-seven million, four hundred forty-four thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •