Base | Representation |
---|---|
bin | 10110100011111011010… |
… | …011111010111101011101 |
3 | 12111012212100122120012111 |
4 | 112203323103322331131 |
5 | 200400212024430023 |
6 | 3144125045434021 |
7 | 220004320031053 |
oct | 26437323727535 |
9 | 5435770576174 |
10 | 1550404530013 |
11 | 548582a35869 |
12 | 21058b40b911 |
13 | b3282c227b1 |
14 | 5507b9c01d3 |
15 | 2a4e24ea00d |
hex | 168fb4faf5d |
1550404530013 has 4 divisors (see below), whose sum is σ = 1550552184028. Its totient is φ = 1550256876000.
The previous prime is 1550404529957. The next prime is 1550404530043. The reversal of 1550404530013 is 3100354040551.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 606471810169 + 943932719844 = 778763^2 + 971562^2 .
It is a cyclic number.
It is not a de Polignac number, because 1550404530013 - 237 = 1412965576541 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1550404530043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73811256 + ... + 73832257.
It is an arithmetic number, because the mean of its divisors is an integer number (387638046007).
Almost surely, 21550404530013 is an apocalyptic number.
It is an amenable number.
1550404530013 is a deficient number, since it is larger than the sum of its proper divisors (147654015).
1550404530013 is a wasteful number, since it uses less digits than its factorization.
1550404530013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147654014.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 1550404530013 its reverse (3100354040551), we get a palindrome (4650758570564).
The spelling of 1550404530013 in words is "one trillion, five hundred fifty billion, four hundred four million, five hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •