Base | Representation |
---|---|
bin | 10100101000011000101… |
… | …100111000111000000001 |
3 | 12000112110200120112212121 |
4 | 110220120230320320001 |
5 | 141212024412100121 |
6 | 3003150152324241 |
7 | 204300154000633 |
oct | 24503054707001 |
9 | 5015420515777 |
10 | 1417753628161 |
11 | 4a72a1a64962 |
12 | 1aa92a9a3681 |
13 | a3902a952b0 |
14 | 4c896422a53 |
15 | 26d2ba9e141 |
hex | 14a18b38e01 |
1417753628161 has 8 divisors (see below), whose sum is σ = 1526821274664. Its totient is φ = 1308687363840.
The previous prime is 1417753628143. The next prime is 1417753628167. The reversal of 1417753628161 is 1618263577141.
It can be written as a sum of positive squares in 4 ways, for example, as 71225468161 + 1346528160000 = 266881^2 + 1160400^2 .
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 1417753628161 - 219 = 1417753103873 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1417753628099 and 1417753628108.
It is not an unprimeable number, because it can be changed into a prime (1417753628167) 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, 2946531 + ... + 3393751.
It is an arithmetic number, because the mean of its divisors is an integer number (190852659333).
Almost surely, 21417753628161 is an apocalyptic number.
It is an amenable number.
1417753628161 is a deficient number, since it is larger than the sum of its proper divisors (109067646503).
1417753628161 is a wasteful number, since it uses less digits than its factorization.
1417753628161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 691091.
The product of its digits is 1693440, while the sum is 52.
The spelling of 1417753628161 in words is "one trillion, four hundred seventeen billion, seven hundred fifty-three million, six hundred twenty-eight thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •