Base | Representation |
---|---|
bin | 110000100010111010… |
… | …0001001101110100101 |
3 | 100222002101201211202210 |
4 | 1201011310021232211 |
5 | 3202001112424331 |
6 | 115520402154033 |
7 | 10350265515411 |
oct | 1410564115645 |
9 | 328071654683 |
10 | 104250514341 |
11 | 40237774476 |
12 | 18255352919 |
13 | 9aa52c399c |
14 | 508d785d41 |
15 | 2aa2496446 |
hex | 1845d09ba5 |
104250514341 has 8 divisors (see below), whose sum is σ = 139007419200. Its totient is φ = 69496976192.
The previous prime is 104250514331. The next prime is 104250514399. The reversal of 104250514341 is 143415052401.
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 104250514341 - 226 = 104183405477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104250514299 and 104250514308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104250514321) 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 7 ways as a sum of consecutive naturals, for example, 768516 + ... + 893933.
It is an arithmetic number, because the mean of its divisors is an integer number (17375927400).
Almost surely, 2104250514341 is an apocalyptic number.
It is an amenable number.
104250514341 is a deficient number, since it is larger than the sum of its proper divisors (34756904859).
104250514341 is a wasteful number, since it uses less digits than its factorization.
104250514341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1683355.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 104250514341 its reverse (143415052401), we get a palindrome (247665566742).
The spelling of 104250514341 in words is "one hundred four billion, two hundred fifty million, five hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •