Base | Representation |
---|---|
bin | 110000011110011011… |
… | …1101000010011000001 |
3 | 100221200221022211012001 |
4 | 1200330313220103001 |
5 | 3201144202243131 |
6 | 115453441304001 |
7 | 10343464030645 |
oct | 1407467502301 |
9 | 327627284161 |
10 | 104100431041 |
11 | 4016aa85692 |
12 | 18213035001 |
13 | 9a80195bb9 |
14 | 5077878c25 |
15 | 2a941ec261 |
hex | 183cde84c1 |
104100431041 has 4 divisors (see below), whose sum is σ = 104108263812. Its totient is φ = 104092598272.
The previous prime is 104100431027. The next prime is 104100431053. The reversal of 104100431041 is 140134001401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 18911750400 + 85188680641 = 137520^2 + 291871^2 .
It is a cyclic number.
It is not a de Polignac number, because 104100431041 - 25 = 104100431009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104100431641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3896416 + ... + 3923041.
It is an arithmetic number, because the mean of its divisors is an integer number (26027065953).
Almost surely, 2104100431041 is an apocalyptic number.
It is an amenable number.
104100431041 is a deficient number, since it is larger than the sum of its proper divisors (7832771).
104100431041 is an equidigital number, since it uses as much as digits as its factorization.
104100431041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7832770.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 104100431041 its reverse (140134001401), we get a palindrome (244234432442).
The spelling of 104100431041 in words is "one hundred four billion, one hundred million, four hundred thirty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •