Base | Representation |
---|---|
bin | 10110100011101001011… |
… | …011001000101100110101 |
3 | 12111012002102221222022112 |
4 | 112203221123020230311 |
5 | 200344103213301123 |
6 | 3144035205340405 |
7 | 216664014161036 |
oct | 26435133105465 |
9 | 5435072858275 |
10 | 1550104431413 |
11 | 5484395a429a |
12 | 210506a07705 |
13 | b32359bbb65 |
14 | 5504dbc2a8d |
15 | 2a4c5ebbd78 |
hex | 168e96c8b35 |
1550104431413 has 2 divisors, whose sum is σ = 1550104431414. Its totient is φ = 1550104431412.
The previous prime is 1550104431277. The next prime is 1550104431439. The reversal of 1550104431413 is 3141344010551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 920078068849 + 630026362564 = 959207^2 + 793742^2 .
It is a cyclic number.
It is not a de Polignac number, because 1550104431413 - 220 = 1550103382837 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1550104431413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1550104439413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 775052215706 + 775052215707.
It is an arithmetic number, because the mean of its divisors is an integer number (775052215707).
Almost surely, 21550104431413 is an apocalyptic number.
It is an amenable number.
1550104431413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1550104431413 is an equidigital number, since it uses as much as digits as its factorization.
1550104431413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 1550104431413 its reverse (3141344010551), we get a palindrome (4691448441964).
The spelling of 1550104431413 in words is "one trillion, five hundred fifty billion, one hundred four million, four hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •