Base | Representation |
---|---|
bin | 10111101111111110100000… |
… | …111110100010101100101011 |
3 | 111200211111220012100202000212 |
4 | 113233332200332202230223 |
5 | 102142320204131433120 |
6 | 1010052331404451335 |
7 | 31000260122266064 |
oct | 2757764076425453 |
9 | 450744805322025 |
10 | 104452010421035 |
11 | 30310937908282 |
12 | b86b5bab49b4b |
13 | 4638a229a5174 |
14 | 1bb170ba5356b |
15 | c120832886c5 |
hex | 5effa0fa2b2b |
104452010421035 has 8 divisors (see below), whose sum is σ = 125355227451216. Its totient is φ = 83553065039520.
The previous prime is 104452010421013. The next prime is 104452010421047. The reversal of 104452010421035 is 530124010254401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104452010421035 - 26 = 104452010420971 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104452010420992 and 104452010421010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1067858369 + ... + 1067956178.
It is an arithmetic number, because the mean of its divisors is an integer number (15669403431402).
Almost surely, 2104452010421035 is an apocalyptic number.
104452010421035 is a deficient number, since it is larger than the sum of its proper divisors (20903217030181).
104452010421035 is an equidigital number, since it uses as much as digits as its factorization.
104452010421035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2135824333.
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 104452010421035 its reverse (530124010254401), we get a palindrome (634576020675436).
The spelling of 104452010421035 in words is "one hundred four trillion, four hundred fifty-two billion, ten million, four hundred twenty-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •