Base | Representation |
---|---|
bin | 110000011011110011… |
… | …1000101111101111001 |
3 | 100221110210022201201121 |
4 | 1200313213011331321 |
5 | 3201004111210131 |
6 | 115441010345241 |
7 | 10341343124605 |
oct | 1406747057571 |
9 | 327423281647 |
10 | 104012210041 |
11 | 401251a9973 |
12 | 181a958b221 |
13 | 9a67b1791c |
14 | 5069c72505 |
15 | 2a8b5c2911 |
hex | 18379c5f79 |
104012210041 has 8 divisors (see below), whose sum is σ = 104328465120. Its totient is φ = 103696050528.
The previous prime is 104012209997. The next prime is 104012210047. The reversal of 104012210041 is 140012210401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104012210041 - 225 = 103978655609 is a prime.
It is a super-2 number, since 2×1040122100412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104012209997 and 104012210024.
It is not an unprimeable number, because it can be changed into a prime (104012210047) 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, 2584965 + ... + 2624893.
It is an arithmetic number, because the mean of its divisors is an integer number (13041058140).
Almost surely, 2104012210041 is an apocalyptic number.
It is an amenable number.
104012210041 is a deficient number, since it is larger than the sum of its proper divisors (316255079).
104012210041 is an equidigital number, since it uses as much as digits as its factorization.
104012210041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47783.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 104012210041 its reverse (140012210401), we get a palindrome (244024420442).
The spelling of 104012210041 in words is "one hundred four billion, twelve million, two hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •