Base | Representation |
---|---|
bin | 10111101101111100010100… |
… | …011111001100100010111001 |
3 | 111200100011001120120002212010 |
4 | 113231330110133030202321 |
5 | 102133022403344040441 |
6 | 1005504211511440133 |
7 | 30654210626123442 |
oct | 2755742437144271 |
9 | 450304046502763 |
10 | 104312214440121 |
11 | 3026761a701756 |
12 | b8484a5686049 |
13 | 46287a447692c |
14 | 1ba8a495722c9 |
15 | c0d600417116 |
hex | 5edf147cc8b9 |
104312214440121 has 4 divisors (see below), whose sum is σ = 139082952586832. Its totient is φ = 69541476293412.
The previous prime is 104312214440111. The next prime is 104312214440149. The reversal of 104312214440121 is 121044412213401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 104312214440121 - 217 = 104312214309049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104312214440111) 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, 17385369073351 + ... + 17385369073356.
It is an arithmetic number, because the mean of its divisors is an integer number (34770738146708).
Almost surely, 2104312214440121 is an apocalyptic number.
It is an amenable number.
104312214440121 is a deficient number, since it is larger than the sum of its proper divisors (34770738146711).
104312214440121 is an equidigital number, since it uses as much as digits as its factorization.
104312214440121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34770738146710.
The product of its (nonzero) digits is 6144, while the sum is 30.
Adding to 104312214440121 its reverse (121044412213401), we get a palindrome (225356626653522).
The spelling of 104312214440121 in words is "one hundred four trillion, three hundred twelve billion, two hundred fourteen million, four hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •