Base | Representation |
---|---|
bin | 10111101011000010000010… |
… | …110010000010101101100001 |
3 | 111122122000210022202111100102 |
4 | 113223002002302002231201 |
5 | 102121233242030131200 |
6 | 1005232252434232145 |
7 | 30633600256334054 |
oct | 2753020262025541 |
9 | 448560708674312 |
10 | 104112201411425 |
11 | 3019a811551939 |
12 | b815785725655 |
13 | 461297a54548c |
14 | 1b9d0b385ca9b |
15 | c082e5c6c6d5 |
hex | 5eb082c82b61 |
104112201411425 has 6 divisors (see below), whose sum is σ = 129099129750198. Its totient is φ = 83289761129120.
The previous prime is 104112201411359. The next prime is 104112201411437. The reversal of 104112201411425 is 524114102211401.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 6387568788496 + 97724632622929 = 2527364^2 + 9885577^2 .
It is not a de Polignac number, because 104112201411425 - 222 = 104112197217121 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2082244028204 + ... + 2082244028253.
It is an arithmetic number, because the mean of its divisors is an integer number (21516521625033).
Almost surely, 2104112201411425 is an apocalyptic number.
It is an amenable number.
104112201411425 is a deficient number, since it is larger than the sum of its proper divisors (24986928338773).
104112201411425 is an equidigital number, since it uses as much as digits as its factorization.
104112201411425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4164488056467 (or 4164488056462 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 29.
Adding to 104112201411425 its reverse (524114102211401), we get a palindrome (628226303622826).
The spelling of 104112201411425 in words is "one hundred four trillion, one hundred twelve billion, two hundred one million, four hundred eleven thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.940 sec. • engine limits •