Base | Representation |
---|---|
bin | 10110100100000010100… |
… | …001000011000010111001 |
3 | 12111020011210002222110002 |
4 | 112210002201003002321 |
5 | 200400434001132023 |
6 | 3144145044402345 |
7 | 220010315353211 |
oct | 26440241030271 |
9 | 5436153088402 |
10 | 1550525411513 |
11 | 548635199931 |
12 | 2106039a63b5 |
13 | b32a1c97a00 |
14 | 5508da89241 |
15 | 2a4ece26b28 |
hex | 169028430b9 |
1550525411513 has 6 divisors (see below), whose sum is σ = 1678971303774. Its totient is φ = 1431254225856.
The previous prime is 1550525411453. The next prime is 1550525411549. The reversal of 1550525411513 is 3151145250551.
It can be written as a sum of positive squares in 3 ways, for example, as 10960624249 + 1539564787264 = 104693^2 + 1240792^2 .
It is not a de Polignac number, because 1550525411513 - 216 = 1550525345977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1550525411593) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4587353120 + ... + 4587353457.
It is an arithmetic number, because the mean of its divisors is an integer number (279828550629).
Almost surely, 21550525411513 is an apocalyptic number.
1550525411513 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1550525411513 is a deficient number, since it is larger than the sum of its proper divisors (128445892261).
1550525411513 is an equidigital number, since it uses as much as digits as its factorization.
1550525411513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9174706603 (or 9174706590 counting only the distinct ones).
The product of its (nonzero) digits is 75000, while the sum is 38.
The spelling of 1550525411513 in words is "one trillion, five hundred fifty billion, five hundred twenty-five million, four hundred eleven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •